@inproceedings{54afbdd09c15432ca13b436904d5f5b6,

title = "Applications of an Exact Formula for the Largest Minimum Distance of Block Codes",

abstract = "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δ)-codes is given exactly by the maximum large deviation rate function of the normalized distance between two i.i.d. random codewords.",

author = "Chang, {Ling Hua} and Carol Wang and Po-Ning Chen and Tan, {Vincent Y.F.} and Han, {Yunghsiang S.}",

year = "2018",

month = may,

day = "21",

doi = "10.1109/CISS.2018.8362289",

language = "English",

series = "2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2018 52nd Annual Conference on Information Sciences and Systems, CISS 2018",

address = "United States",

note = "null ; Conference date: 21-03-2018 Through 23-03-2018",

}