On the Maximum Size of Block Codes Subject to a Distance Criterion
檔案
本條目沒有附加檔案。
日期
2019-06-01
類型
系所
期刊名稱
IEEE TRANSACTIONS ON INFORMATION THEORY
卷期與頁次
第 65 卷第 6 期,頁 3751–3757
ISSN
0018-9448
語言
英文
摘要
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than d. The achievability argument involves an iterative construction of a set of radius-d balls, each centered at a codeword. We demonstrate that the number of such balls that cover the entire code space cannot exceed this maximum size. Our approach can be applied to codes i) with elements over arbitrary code alphabets, and ii) under a broad class of distance measures. Our formula indicates that the maximum code size can be fully characterized by the cumulative distribution function of the distance measure evaluated at two independent and identically distributed random codewords. When the two random codewords assume a uniform distribution over the entire code alphabet, our formula recovers and thus naturally generalizes the Gilbert-Varshamov (GV) lower bound. Finally, we extend our study to the asymptotic setting.
所屬典藏
期刊論文引用此條目
Chang, L.-H., Chen, P.-N., Tan, V. Y. F., Wang, C., & Han, Y. S. (2019). On the Maximum Size of Block Codes Subject to a Distance Criterion. IEEE TRANSACTIONS ON INFORMATION THEORY, 65(6), 3751–3757. https://doi.org/10.1109/TIT.2018.2889244
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/152351