DocumentCode :
1553022
Title :
Constructions of nonlinear covering codes
Author :
Davydov, Alexander A.
Author_Institution :
Inst. of Problems of Inf. Transmission, Acad. of Sci., Moscow, Russia
Volume :
43
Issue :
5
fYear :
1997
fDate :
9/1/1997 12:00:00 AM
Firstpage :
1639
Lastpage :
1647
Abstract :
Constructions of nonlinear covering codes are given. Using any nonlinear starting code of covering radius R⩾2 these constructions form an infinite family of codes with the same covering radius. A nonlinear code is treated as a union of cosets of a linear code. New infinite families of nonlinear covering codes are obtained. Concepts of R,l-objects, R,l-partitions, and R,l-length are described for nonlinear codes
Keywords :
codes; R,l-length; R,l-objects; R,l-partitions; covering radius; infinite family; linear code coset; nonlinear covering codes; nonlinear starting code; Binary codes; Error correction codes; Galois fields; Hamming distance; Information theory; Joining materials; Linear code; Parity check codes; Vectors;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.623166
Filename :
623166
Link To Document :
بازگشت