標題: Applications of an Exact Formula for the Largest Minimum Distance of Block Codes
作者: Chang, Ling-Hua
Wang, Carol
Chen, Po-Ning
Tan, Vincent Y. F.
Han, Yunghsiang S.
電機工程學系
電信工程研究所
Department of Electrical and Computer Engineering
Institute of Communications Engineering
公開日期: 1-Jan-2018
摘要: An exact information spectrum-type formula for the maximum size of finite length block codes subject to a minimum pairwise distance constraint is presented. This formula can be applied to codes for a broad class of distance measures, which only requires having the minimum value between a point and itself. As revealed by the formula, the largest code size is fully characterized by the information spectrum of the distance between two independent and identically distributed (i.i.d.) random codewords drawn from an optimal distribution. Under an arbitrary uniformly bounded distance measure, the asymptotic largest code rate (in the block length n) attainable for a sequence of (n; M; n delta)-codes is given exactly by the maximum large deviation rate function of the normalized distance between two i.i.d. random codewords.
URI: http://hdl.handle.net/11536/146184
期刊: 2018 52ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS)
Appears in Collections:Conferences Paper