Ultra-small block-codes for binary discrete memoryless channels

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


研究成果: Conference contribution同行評審

4 引文 斯高帕斯(Scopus)


Block-codes with a very small number of codewords are Investigated for the two special binary memoryless channels, the binary symmetric channel (BSC) and the Z-channel (ZC). The optimal (In the sense of minimum average error probability, using maximum likelihood decoding) code structure Is derived for the cases of two, three, and four codewords and an arbitrary blocklength. It Is shown that for two possible messages, on a BSC, the so-called flip codes of type t are optimal for any t, while on a ZC, the flip code of type 0 Is optimal. For codes with three or four messages It Is shown that the so-called weak flip codes of some given type are optimal where the type depends on the blocklength. For all cases an algorithm Is presented that constructs an optimal code for blocklength n recursively from an optimal code of length n 1. For the ZC a recursive optimal code design Is conjectured In the case of live possible messages. The derivation of these optimal codes relies heavily on a new approach of constructing and analyzing the code-matrix not row-wise (codewords), but column-wise. Moreover, these results also prove that the minimum Hamming distance might be the wrong design criterion for optimal codes even for very symmetric channels like the BSC.

主出版物標題2011 IEEE Information Theory Workshop, ITW 2011
出版狀態Published - 21 12月 2011
事件2011 IEEE Information Theory Workshop, ITW 2011 - Paraty, Brazil
持續時間: 16 10月 201120 10月 2011


名字2011 IEEE Information Theory Workshop, ITW 2011


Conference2011 IEEE Information Theory Workshop, ITW 2011


深入研究「Ultra-small block-codes for binary discrete memoryless channels」主題。共同形成了獨特的指紋。