Some new results on binary asymmetric error-correcting codes

Ghang Ming Fang; Henk C.A. van Tilborg

doi:10.1109/ISIT.1991.695199

Some new results on binary asymmetric error-correcting codes

Ghang Ming Fang, Henk C.A. van Tilborg

Mathematics and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

Let C(n,δA_s) denote a binary, asymmetric error-correcting code of length n and asymmetric minimum distance d_A_s. Such a code is called optimal, if it has maximum size. This maximum size is denoted by A_A_s(n,d_A_s,) It is shown that there exist exactly four non-isomorphic optimal C(3,2) codes, four non-isomorphic optimal C(5,2) codes and twelve non-isomorphic optimal C(7,2) codes. Further it is proved that optimal C(n, 2) codes of length n=2,4,6 and 8 must be unique. The sizes of all theses codes are given in the following table.

Original language	English
Title of host publication	Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	143
Number of pages	1
ISBN (Print)	0-7803-0056-4
DOIs	https://doi.org/10.1109/ISIT.1991.695199
Publication status	Published - 1 Jan 1991
Event	1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary Duration: 24 Jun 1991 → 28 Jun 1991

Conference

Conference	1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/Territory	Hungary
City	Budapest
Period	24/06/91 → 28/06/91

Access to Document

10.1109/ISIT.1991.695199

Cite this

@inproceedings{bfe722ee131d479db972364cbc9707c6,

title = "Some new results on binary asymmetric error-correcting codes",

abstract = "Let C(n,δAs) denote a binary, asymmetric error-correcting code of length n and asymmetric minimum distance dAs. Such a code is called optimal, if it has maximum size. This maximum size is denoted by AAs(n,dAs,) It is shown that there exist exactly four non-isomorphic optimal C(3,2) codes, four non-isomorphic optimal C(5,2) codes and twelve non-isomorphic optimal C(7,2) codes. Further it is proved that optimal C(n, 2) codes of length n=2,4,6 and 8 must be unique. The sizes of all theses codes are given in the following table.",

author = "Fang, {Ghang Ming} and {van Tilborg}, {Henk C.A.}",

year = "1991",

month = jan,

day = "1",

doi = "10.1109/ISIT.1991.695199",

language = "English",

isbn = "0-7803-0056-4",

pages = "143",

booktitle = "Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "1991 IEEE International Symposium on Information Theory, ISIT 1991 ; Conference date: 24-06-1991 Through 28-06-1991",

}

Fang, GM & van Tilborg, HCA 1991, Some new results on binary asymmetric error-correcting codes. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695199, Institute of Electrical and Electronics Engineers, Piscataway, pp. 143, 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 24/06/91. https://doi.org/10.1109/ISIT.1991.695199

Some new results on binary asymmetric error-correcting codes. / Fang, Ghang Ming; van Tilborg, Henk C.A.
Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Piscataway: Institute of Electrical and Electronics Engineers, 1991. p. 143 695199.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Some new results on binary asymmetric error-correcting codes

AU - Fang, Ghang Ming

AU - van Tilborg, Henk C.A.

PY - 1991/1/1

Y1 - 1991/1/1

N2 - Let C(n,δAs) denote a binary, asymmetric error-correcting code of length n and asymmetric minimum distance dAs. Such a code is called optimal, if it has maximum size. This maximum size is denoted by AAs(n,dAs,) It is shown that there exist exactly four non-isomorphic optimal C(3,2) codes, four non-isomorphic optimal C(5,2) codes and twelve non-isomorphic optimal C(7,2) codes. Further it is proved that optimal C(n, 2) codes of length n=2,4,6 and 8 must be unique. The sizes of all theses codes are given in the following table.

AB - Let C(n,δAs) denote a binary, asymmetric error-correcting code of length n and asymmetric minimum distance dAs. Such a code is called optimal, if it has maximum size. This maximum size is denoted by AAs(n,dAs,) It is shown that there exist exactly four non-isomorphic optimal C(3,2) codes, four non-isomorphic optimal C(5,2) codes and twelve non-isomorphic optimal C(7,2) codes. Further it is proved that optimal C(n, 2) codes of length n=2,4,6 and 8 must be unique. The sizes of all theses codes are given in the following table.

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

U2 - 10.1109/ISIT.1991.695199

DO - 10.1109/ISIT.1991.695199

M3 - Conference contribution

AN - SCOPUS:85067482545

SN - 0-7803-0056-4

SP - 143

BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 1991 IEEE International Symposium on Information Theory, ISIT 1991

Y2 - 24 June 1991 through 28 June 1991

ER -

Some new results on binary asymmetric error-correcting codes

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this