Determination of the asymptotic largest minimum distance of block codes

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

doi:10.1109/ISIT.2000.866525

Determination of the asymptotic largest minimum distance of block codes

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

Department of Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

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.

Original language	English
Article number	866525
Pages (from-to)	227
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/ISIT.2000.866525
State	Published - 25 Jun 2000
Event	2000 IEEE International Symposium on Information Theory - Serrento, Italy Duration: 25 Jun 2000 → 30 Jun 2000

Access to Document

10.1109/ISIT.2000.866525

Cite this

@article{25733ac8e0a0443fad201e25fb45c78c,

title = "Determination of the asymptotic largest minimum distance of block codes",

abstract = "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.",

author = "Lee, {T. Y.} and Po-Ning Chen and Han, {Y. S.}",

year = "2000",

month = jun,

day = "25",

doi = "10.1109/ISIT.2000.866525",

language = "English",

pages = "227",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

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

note = "2000 IEEE International Symposium on Information Theory ; Conference date: 25-06-2000 Through 30-06-2000",

}

TY - JOUR

T1 - Determination of the asymptotic largest minimum distance of block codes

AU - Lee, T. Y.

AU - Chen, Po-Ning

AU - Han, Y. S.

PY - 2000/6/25

Y1 - 2000/6/25

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034448176&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2000.866525

DO - 10.1109/ISIT.2000.866525

M3 - Conference article

AN - SCOPUS:0034448176

SN - 2157-8095

SP - 227

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

M1 - 866525

T2 - 2000 IEEE International Symposium on Information Theory

Y2 - 25 June 2000 through 30 June 2000

ER -

Determination of the asymptotic largest minimum distance of block codes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this