New single asymmetric error-correcting codes

Sulaiman Al-Bassam; Ramachandran Venkatesan; Sultan Al-Muhammadi

doi:10.1109/18.623162

New single asymmetric error-correcting codes

Sulaiman Al-Bassam^*, Ramachandran Venkatesan, Sultan Al-Muhammadi

^*Corresponding author for this work

Department of Information and Computer Science

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

13 Scopus citations

Abstract

New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n = 12 and n = 15. In many cases one can construct a code C containing at least [2ⁿ/n] codewords. It is known that a code with |C| ≥ [2ⁿ /(n + 1)] can be easily obtained. It should be noted that the proposed codes for n = 12 and n = 15 are also the best known codes that can be explicitly constructed, since the best of the existing codes for these values of n are based on combinatorial arguments. Useful partitions of binary vectors are also presented.

Original language	English
Pages (from-to)	1619-1623
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	43
Issue number	5
DOIs	https://doi.org/10.1109/18.623162
State	Published - 1997

Bibliographical note

Funding Information:
The authors gratefully acknowledge the support provided by King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia, to carry out this work. Thanks are also due to the anonymous referee whose queries and suggestions have improved this correspondence.

Keywords

Asymmetric error-correcting codes
Constant-weight codes
Lower bounds
Partitions

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.623162

Cite this

@article{b8664afc1ba94f01b0072dbe3b9ccdd0,

title = "New single asymmetric error-correcting codes",

abstract = "New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n = 12 and n = 15. In many cases one can construct a code C containing at least [2n/n] codewords. It is known that a code with |C| ≥ [2n /(n + 1)] can be easily obtained. It should be noted that the proposed codes for n = 12 and n = 15 are also the best known codes that can be explicitly constructed, since the best of the existing codes for these values of n are based on combinatorial arguments. Useful partitions of binary vectors are also presented.",

keywords = "Asymmetric error-correcting codes, Constant-weight codes, Lower bounds, Partitions",

author = "Sulaiman Al-Bassam and Ramachandran Venkatesan and Sultan Al-Muhammadi",

note = "Funding Information: The authors gratefully acknowledge the support provided by King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia, to carry out this work. Thanks are also due to the anonymous referee whose queries and suggestions have improved this correspondence.",

year = "1997",

doi = "10.1109/18.623162",

language = "English",

volume = "43",

pages = "1619--1623",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

number = "5",

}

TY - JOUR

T1 - New single asymmetric error-correcting codes

AU - Al-Bassam, Sulaiman

AU - Venkatesan, Ramachandran

AU - Al-Muhammadi, Sultan

N1 - Funding Information: The authors gratefully acknowledge the support provided by King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia, to carry out this work. Thanks are also due to the anonymous referee whose queries and suggestions have improved this correspondence.

PY - 1997

Y1 - 1997

N2 - New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n = 12 and n = 15. In many cases one can construct a code C containing at least [2n/n] codewords. It is known that a code with |C| ≥ [2n /(n + 1)] can be easily obtained. It should be noted that the proposed codes for n = 12 and n = 15 are also the best known codes that can be explicitly constructed, since the best of the existing codes for these values of n are based on combinatorial arguments. Useful partitions of binary vectors are also presented.

AB - New single asymmetric error-correcting codes are proposed. These codes are better than existing codes when the code length n is greater than 10, except for n = 12 and n = 15. In many cases one can construct a code C containing at least [2n/n] codewords. It is known that a code with |C| ≥ [2n /(n + 1)] can be easily obtained. It should be noted that the proposed codes for n = 12 and n = 15 are also the best known codes that can be explicitly constructed, since the best of the existing codes for these values of n are based on combinatorial arguments. Useful partitions of binary vectors are also presented.

KW - Asymmetric error-correcting codes

KW - Constant-weight codes

KW - Lower bounds

KW - Partitions

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

U2 - 10.1109/18.623162

DO - 10.1109/18.623162

M3 - Article

AN - SCOPUS:0031234378

SN - 0018-9448

VL - 43

SP - 1619

EP - 1623

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

New single asymmetric error-correcting codes

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this