Determination of the asymptotic largest minimum distance of block codes

T. Y. Lee, Po-Ning Chen, Y. S. Han

研究成果: Conference article同行評審

摘要

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.

原文English
文章編號866525
頁(從 - 到)227
頁數1
期刊IEEE International Symposium on Information Theory - Proceedings
DOIs
出版狀態Published - 25 6月 2000
事件2000 IEEE International Symposium on Information Theory - Serrento, Italy
持續時間: 25 6月 200030 6月 2000

指紋

深入研究「Determination of the asymptotic largest minimum distance of block codes」主題。共同形成了獨特的指紋。

引用此