Problem
Research questions and friction points this paper is trying to address.
Mismatched Decoding
Binary-Input Channels
Converse Theorem
Diagnosing the Refuted Mismatched Decoding Converse for Binary-Input Channels
🤖 AI Summary
本文诊断了Balakirsky关于二进制输入信道错配解码的反向定理证明中的问题，指出其置换引理及特定步骤存在错误。
📝 Abstract
We revisit the claimed converse theorem for mismatched decoding over binary-input discrete memoryless channels (Balakirsky, 1995) and the subsequent work refuting this converse via a numerical counter-example (Scarlett, Somekh-Baruch, Martinez, and Guillén i Fàbregas, 2015). A notable gap in the existing understanding is that no concrete flaw was identified in Balakirsky's analysis. In this paper, Balakirsky's proof is "diagnosed", and it is demonstrated that (i) his permutation lemma is flawed regardless of the correctness of his combinatorial approximation lemma; (ii) there are at least two specific incorrect steps regarding restricted codes and selector sequences, and these appear to be unlikely to admit a local repair; and (iii) the proposition in which these incorrect steps are used is false in general.
Innovation
Methods, ideas, or system contributions that make the work stand out.
mismatched decoding
binary-input channels
converse theorem
permutation lemma
combinatorial approximation
🔎 Similar Papers
No similar papers found.
