Nonlinear Codes Outperform the Best Linear Codes on the Binary Erasure Channel
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1755 | en_US |
dc.citation.spage |
1751 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Chen, Po-Ning | en_US |
dc.contributor.author |
Lin, Hsuan-Yin | en_US |
dc.contributor.author |
Moser, Stefan M. | en_US |
dc.contributor.department |
電機學院 | zh_TW |
dc.contributor.department |
College of Electrical and Computer Engineering | en_US |
dc.date.accessioned |
2017-04-21T06:49:34Z | |
dc.date.available |
2017-04-21T06:49:34Z | |
dc.date.issued |
2015 | en_US |
dc.description.abstract |
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 < delta < 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 fit\'\', 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 - 2(3). | en_US |
dc.identifier.isbn |
978-1-4673-7704-1 | en_US |
dc.identifier.journal |
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/136303 | |
dc.identifier.wosnumber |
WOS:000380904701161 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Binary erasure channel | en_US |
dc.subject |
generalized Plotkin bound | en_US |
dc.subject |
optimal nonlinear channel coding | en_US |
dc.subject |
r-wise Hamming distance | en_US |
dc.subject |
weak flip codes | en_US |
dc.title |
Nonlinear Codes Outperform the Best Linear Codes on the Binary Erasure Channel | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Chen, P.-N., Lin, H.-Y., & Moser, S. M. (2015). Nonlinear Codes Outperform the Best Linear Codes on the Binary Erasure Channel. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 1751–1755. https://ir.lib.nycu.edu.tw/handle/11536/136303
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/136303