Abstract
In reference (1).R.D.Baker gives a convenient characterisation of Preparata codes.
We here give a proof of his description and a similar one for Kerdock codes.
Preview
Unable to display preview. Download preview PDF.
References
Ronald D. Baker, Jacubus H. Van Lint and Richard M. Wilson "On the Preparata and Goethals codes" IEEE Trans Inform Theory Vol IT.29, pp 342–345,May 1983
P.Camion "codes de Preparata et codes de Kerdock" théorie des codes ENSTA (1979) pp 21–29
W.M. Kantor "On the inequivalence of generalized Preparata codes" IEEE Trans Inform Theory, Vol IT.29 pp 345–348,May 1983.
A.M. Kerdock "A class of low-rate non linear codes" Information and Control, 20 (1972) pp182–187
F.J.Mac Williams and N.J.Sloane. "The theory of error-correcting codes" Amsterdam,North Holland.
F.P. Preparata, "A class of optimum non linear double-error correcting codes" Information and Control, 13 (1968) pp 378–400
J.H. Van Lint "Kerdock codes and Preparata codes" Congressus Numerantium vol 39 (1983) pp 25–41.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlet, C. (1989). A simple description of Kerdock codes. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019858
Download citation
DOI: https://doi.org/10.1007/BFb0019858
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51643-9
Online ISBN: 978-3-540-46726-7
eBook Packages: Springer Book Archive