Skip to main content

A simple description of Kerdock codes

  • Section III Combinatorial And Algebraic Aspects
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 388))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Article  Google Scholar 

  2. P.Camion "codes de Preparata et codes de Kerdock" théorie des codes ENSTA (1979) pp 21–29

    Google Scholar 

  3. W.M. Kantor "On the inequivalence of generalized Preparata codes" IEEE Trans Inform Theory, Vol IT.29 pp 345–348,May 1983.

    Article  Google Scholar 

  4. A.M. Kerdock "A class of low-rate non linear codes" Information and Control, 20 (1972) pp182–187

    Article  Google Scholar 

  5. F.J.Mac Williams and N.J.Sloane. "The theory of error-correcting codes" Amsterdam,North Holland.

    Google Scholar 

  6. F.P. Preparata, "A class of optimum non linear double-error correcting codes" Information and Control, 13 (1968) pp 378–400

    Article  Google Scholar 

  7. J.H. Van Lint "Kerdock codes and Preparata codes" Congressus Numerantium vol 39 (1983) pp 25–41.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gérard Cohen Jacques Wolfmann

Rights and permissions

Reprints 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

Publish with us

Policies and ethics