Citation
Abstract
The performance of an important class of low-rate nonlinear binary codes recently discovered by A. M. Kerdock is superior to linear codes with the same parameters. Before these codes can be put to practical use, several questions remain to be answered. This article considers one of the questions and shows that the nonlinear Kerdock codes are systematic; i.e., they have distinguishable information and check positions. filx) = Tr(qx) + Qyx) + A f(x) = Tr(qx + yx) + Q(yx) + B 8 = fila"), t; = fe(a*),
Details
- Volume
- IX
- Published
- June 15, 1972
- Pages
- 82–83
- File Size
- 129.1 KB