Title :
Determination of the asymptotic largest minimum distance of block codes
Author :
Lee, Tzong-Yow ; Chen, Po-Ning ; Han, Yunghsiang S.
Author_Institution :
Dept. of Math., Maryland Univ., College Park, MD, USA
Abstract :
We present a general formula for the asymptotic largest minimum distance (in blocklength) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric and bounded). An alternative expression for the same formula, which is useful in characterizing the general Varshamov-Gilbert bound, is next addressed
Keywords :
block codes; probability; random codes; Varshamov-Gilbert bound; asymptotic largest minimum distance; blocklength; deterministic block codes; general formula; probabilistic methodology; random coding; Block codes; Computer science; Councils; Educational institutions; Mathematics; Probability; Stability; TV;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866525
