Connections between the Error Probability and the r-wise Hamming Distances

Hsuan Yin Lin, Stefan Michael Moser, Po-Ning Chen

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

An extension from the pairwise Hamming distance to the r-wise Hamming distance is presented. It can be used to fully characterize the maximum-likelihood decoding (MLD) error of an arbitrary code over the binary erasure channel (BEC). By noting that good codes always have large minimum r-wise Hamming distances for all r, a new design criterion for a code is introduced: the minimum r-wise Hamming distance. We then prove an upper bound for the minimum r-wise Hamming distance of an arbitrary code, called the generalized Plotkin bound, and provide a class of (nonlinear) codes that achieve the bound for every r.

原文English
主出版物標題Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
發行者Institute of Electrical and Electronics Engineers Inc.
頁面130-134
頁數5
ISBN(電子)9784885523182
DOIs
出版狀態Published - 8 3月 2019
事件15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore
持續時間: 28 10月 201831 10月 2018

出版系列

名字Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

Conference

Conference15th International Symposium on Information Theory and Its Applications, ISITA 2018
國家/地區Singapore
城市Singapore
期間28/10/1831/10/18

指紋

深入研究「Connections between the Error Probability and the r-wise Hamming Distances」主題。共同形成了獨特的指紋。

引用此