On an upper bound for mixed error-correcting codes

Stephanie Perkins; A. Sakhnovich; Derek Smith

doi:10.1109/TIT.2005.862107

On an upper bound for mixed error-correcting codes

Stephanie Perkins, A. Sakhnovich, Derek Smith

Research output: Contribution to journal › Article › peer-review

Abstract

A mixed code is an error-correcting code in which different entries of the codewords can be chosen from different alphabets. In this correspondence an upper bound is given for the number of codewords in a mixed code where all the entries can come from distinct alphabets. This bound improves the sphere packing bound in several directions. The result is specialized to a simpler form in the case when only two distinct alphabets are used. Numerical results are presented to show that, in various cases, two different forms of the bound and alternative choices of a parameter may give the strongest bound.

Original language	English
Pages (from-to)	708-712
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	52
Issue number	2
DOIs	https://doi.org/10.1109/TIT.2005.862107
Publication status	Published - 28 Feb 2006

Access to Document

10.1109/TIT.2005.862107

Cite this

@article{214c9c0e8ef7491aa8e54dea9969073d,

title = "On an upper bound for mixed error-correcting codes",

abstract = "A mixed code is an error-correcting code in which different entries of the codewords can be chosen from different alphabets. In this correspondence an upper bound is given for the number of codewords in a mixed code where all the entries can come from distinct alphabets. This bound improves the sphere packing bound in several directions. The result is specialized to a simpler form in the case when only two distinct alphabets are used. Numerical results are presented to show that, in various cases, two different forms of the bound and alternative choices of a parameter may give the strongest bound.",

author = "Stephanie Perkins and A. Sakhnovich and Derek Smith",

year = "2006",

month = feb,

day = "28",

doi = "10.1109/TIT.2005.862107",

language = "English",

volume = "52",

pages = "708--712",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "2",

}

TY - JOUR

T1 - On an upper bound for mixed error-correcting codes

AU - Perkins, Stephanie

AU - Sakhnovich, A.

AU - Smith, Derek

PY - 2006/2/28

Y1 - 2006/2/28

N2 - A mixed code is an error-correcting code in which different entries of the codewords can be chosen from different alphabets. In this correspondence an upper bound is given for the number of codewords in a mixed code where all the entries can come from distinct alphabets. This bound improves the sphere packing bound in several directions. The result is specialized to a simpler form in the case when only two distinct alphabets are used. Numerical results are presented to show that, in various cases, two different forms of the bound and alternative choices of a parameter may give the strongest bound.

AB - A mixed code is an error-correcting code in which different entries of the codewords can be chosen from different alphabets. In this correspondence an upper bound is given for the number of codewords in a mixed code where all the entries can come from distinct alphabets. This bound improves the sphere packing bound in several directions. The result is specialized to a simpler form in the case when only two distinct alphabets are used. Numerical results are presented to show that, in various cases, two different forms of the bound and alternative choices of a parameter may give the strongest bound.

U2 - 10.1109/TIT.2005.862107

DO - 10.1109/TIT.2005.862107

M3 - Article

SN - 0018-9448

VL - 52

SP - 708

EP - 712

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

ER -

On an upper bound for mixed error-correcting codes

Abstract

Access to Document

Fingerprint

Cite this