无圈Tanner图码的无伪码字准则
Pseudocodeword-Free Criterion for Codes with Cycle-Free Tanner Graph
摘要：
当底层Tanner图是无圈的时，迭代解码和线性规划解码被保证收敛到最大似然码字。因此，循环通常被视为低密度奇偶校验码（LDPC）的罪魁祸首。在本文中，我们认为在图覆盖伪码字的情况下，对于允许无循环的Tanner图的代码，循环对错误性能没有影响，只要它们是冗余行的一部分。具体来说，我们的特点是所有的奇偶校验矩阵是伪码字免费的这类代码。
英文摘要：
Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low-density parity-check (LDPC) codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a cycle-free Tanner graph, cycles have no effect on error performance as long as they are a part of redundant rows. Specifically, we characterize all parity-check matrices that are pseudocodeword-free for such class of codes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
