@inproceedings{d6e23bd90a1d4d5d81e94ad5a11b8ea4,

title = "Distance Spectrum Formula for the Largest Minimum Hamming Distance of Finite-Length Binary Block Codes",

abstract = "In this paper, an exact distance spectrum formula for the largest minimum Hamming distance of finite-length binary block codes is presented. The exact formula indicates that the largest minimum distance of finite-length block codes can be fully characterized by the information spectrum of the Hamming distance between two independent and identically distributed (i.i.d.) random codewords. The distance property of finite-length block codes is then connected to the distance spectrum. A side result of this work is a new lower bound to the largest minimum distance of finite-length block codes. Numerical examinations show that the new lower bound improves the finite-length Gilbert-Varshamov lower bound and can reach the minimum distance of existing finite-length block codes.",

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

year = "2017",

month = nov,

doi = "10.1109/ITW.2017.8277923",

language = "English",

series = "Information Theory Workshop",

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

pages = "419--423",

booktitle = "2017 IEEE Information Theory Workshop, ITW 2017",

address = "United States",

note = "null ; Conference date: 06-11-2017 Through 10-11-2017",

}