arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1711.03310cs.ITmath.IT
收藏

弱翻转码及其在二进制擦除信道上的最优性

Weak Flip Codes and their Optimality on the Binary Erasure Channel

Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen

摘要:

本文研究了非线性二进制码的基本性质,通过看码本矩阵,而不是行(码字),但列。提出了一类弱翻转码,并证明了它具有许多美丽的性质。特别是可以追溯到Berlekamp,Gallager和Shannon的子家族公平弱翻转码,它被证明可以用固定数量的码字$M$实现错误指数,可以被视为线性码到任意数量码字的推广。基于逐列方法,引入了$r$逐汉明距离作为对广泛使用的(逐对)汉明距离的推广。证明了最小$r$ -wise Hamming距离满足广义$r$ -wise Plotkin界.分析了非线性公平弱翻转码的$r$式汉明距离结构,并证明了其优越性。特别地,证明了公平弱翻转码对所有$r$都能达到等性的$r$ -wise Plotkin界.在本文的第二部分中,这些见解被应用到一个二进制擦除信道(BEC)与任意擦除概率。推导出一个精确的公式,用于任意代码使用最大似然解码的平均错误概率,并示出仅使用$r$明智的汉明距离结构的代码是可表达的。对于码字数为$M\leq4$和任意块长的$n$,找到了全局最优码(在最小化平均错误概率的意义下),对于$M=5,6$和任意块长的$n$,得到了全局最优码。对于较大的$M$,给出了关于最优设计的观察结果,例如,好的码对于所有$r$具有大的逐$r$汉明距离结构。数值结果验证了我们的代码设计标准,并显示出我们最好的非线性弱翻转码的优越性相比,最好的线性码。

英文摘要:

This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to Berlekamp, Gallager, and Shannon and which was shown to achieve the error exponent with a fixed number of codewords $M$, can be seen as a generalization of linear codes to an arbitrary number of codewords. Based on the column-wise approach, the $r$-wise Hamming distance is introduced as a generalization to the widely used (pairwise) Hamming distance. It is shown that the minimum $r$-wise Hamming distance satisfies a generalized $r$-wise Plotkin bound. The $r$-wise Hamming distance structure of the nonlinear fair weak flip codes is analyzed and shown to be superior to many codes. In particular, it is proven that the fair weak flip codes achieve the $r$-wise Plotkin bound with equality for all $r$. In the second part of the paper, these insights are applied to a binary erasure channel (BEC) with an arbitrary erasure probability. An exact formula for the average error probability of an arbitrary code using maximum likelihood decoding is derived and shown to be expressible using only the $r$-wise Hamming distance structure of the code. For a number of codewords $M\leq4$ and an arbitrary blocklength $n$, the globally optimal codes (in the sense of minimizing the average error probability) are found. For $M=5,6$ and an arbitrary blocklength $n$, the optimal codes are conjectured. For larger $M$, observations regarding the optimal design are presented, e.g., that good codes have a large $r$-wise Hamming distance structure for all $r$. Numerical results validate our code design criteria and show the superiority of our best found nonlinear weak flip codes compared to the best linear codes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑