In this paper, 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.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - 25 Jun 2000|
|Event||2000 IEEE International Symposium on Information Theory - Serrento, Italy|
Duration: 25 Jun 2000 → 30 Jun 2000