Browsing by Author "Wangl, Carol"

Now showing 1 - 1 of 1

Distance Spectrum Formula for the Largest Minimum Hamming Distance of Finite-Length Binary Block Codes
(2017-01-01)
Chang, Ling-Hua
;
Wangl, Carol
;
Chen, Po-Ning
;
Hant, Yunghsiang S.
;
Tang, Vincent Y. F.
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.