A description is given of two new infinite families of nonlinear binary codes. For all block lengths n = 22m, m ≥ 3, two nonlinear binary codes are defined, which are called dual as their distance distributions satisfy the MacWilliams identities. The first code has minimum distance 8 and has four times as many codewords as the corresponding extended BCH code. In the other code, there are only six distinct nonzero values for the distances between codewords.
References
-
-
1)
-
A.M. Kerdock
.
A class of low-rate nonlinear codes.
Inf. & Control
,
182 -
187
-
2)
-
F.J. Macwilliams ,
N.J.A. Sloane ,
J.M. Goethals
.
The MacWilliams identities for nonlinear codes.
Bell Syst. Tech. J.
,
803 -
819
-
3)
-
P. Delsarte
.
An algebraic approach to the association schemes of coding theory.
Philips Res. Rep. Suppl.
,
10
-
4)
-
F.P. Preparata
.
A class of optimum nonlinear double-error correcting codes.
Inf. & Control
,
378 -
400
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19740375
Related content
content/journals/10.1049/el_19740375
pub_keyword,iet_inspecKeyword,pub_concept
6
6