New Single Asymmetric Error-Correcting Codes

(1997) New Single Asymmetric Error-Correcting Codes. IEEE TRANSACTIONS ON INFORMATION THEORY, 43 (5). pp. 1619-1623.

[img]
Preview
PDF (full text)
Coding_IEEE_97.pdf

Download (240kB) | Preview

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/n] codewords. It is known that a code with |C| >= [2^n/(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.

Item Type: Article
Uncontrolled Keywords: Asymmetric error-correcting codes, constant-weight codes, lower bounds, partitions
Subjects: Computer
Electrical
Divisions: College Of Computer Sciences and Engineering > Information and Computer Science Dept
Depositing User: Dr, SULTAN AHMAD M. AL-MUHAMMADI
Date Deposited: 25 Jun 2008 14:31
Last Modified: 01 Nov 2019 17:03
URI: http://eprints.kfupm.edu.sa/id/eprint/10713