Nonlinear codes outperform the best linear codes on the binary erasure channel

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

研究成果: Conference contribution同行評審

5 引文 斯高帕斯(Scopus)

摘要

The exact value of the average error probability of an arbitrary code (linear or nonlinear) using maximum likelihood decoding is studied on binary erasure channels (BECs) with arbitrary erasure probability 0 < δ < 1. The family of the fair linear codes, which are equivalent to a concatenation of several Hadamard linear codes, is proven to perform better (in the sense of average error probability with respect to maximum-likelihood decoding) than all other linear codes for many values of the blocklength n and for a dimension k = 3. It is then noted that the family of fair linear codes and the family of fair nonlinear weak flip codes both maximize the minimum Hamming distance under certain blocklengths. However, the fair nonlinear weak flip codes actually outperform the fair linear codes, i.e., linearity and global optimality cannot be simultaneously achieved for the number of codewords being M = 23.

原文English
主出版物標題Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
發行者Institute of Electrical and Electronics Engineers Inc.
頁面1751-1755
頁數5
ISBN(電子)9781467377041
DOIs
出版狀態Published - 28 九月 2015
事件IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
持續時間: 14 六月 201519 六月 2015

出版系列

名字IEEE International Symposium on Information Theory - Proceedings
2015-June
ISSN(列印)2157-8095

Conference

ConferenceIEEE International Symposium on Information Theory, ISIT 2015
國家/地區Hong Kong
城市Hong Kong
期間14/06/1519/06/15

指紋

深入研究「Nonlinear codes outperform the best linear codes on the binary erasure channel」主題。共同形成了獨特的指紋。

引用此