Skip to main content
SpringerLink
Log in

Enumeration of self dual 2k circulant codes

  • Conference paper
  • First Online:
Applied Algebra, Algorithmics and Error-Correcting Codes (AAECC 1984)

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

Abstract

In this paper we give necessary and sufficient conditions for the existence of self dual 2k circulant codes. We specify the number of such codes when these conditions are satisfied.

We prove that all possible 2k circulant codes can be constructed by our method, for every possible code length, and every field IFq.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. GFM. Beeker "On double circulant codes" TH Report 80, WSK 04 July 1980.

    Google Scholar 

  2. P. Camion "Etude de codes binaires abéliens modulaires autoduaux de petite longueur" Revue du CETHEDEC, NS79-2.

    Google Scholar 

  3. M. Karlin "New binary coding results by circulant" IEEE Trans. Info. Theory, 15, (1969), pp797–802.

    Google Scholar 

  4. FJ. MacWilliams "Orthogonal circulant matrices over finite fields" Journal of Comb. Th., 10, pp1–17, 1971.

    Google Scholar 

  5. FJ. MacWilliams, NJA. Sloane "The Theory of error correcting codes" North Holland, Mathematic Library, vol 16 (1977)

    Google Scholar 

  6. P.Piret "Good linear codes of length 27 and 28" IEEE Trans. on Info. T., vol. IT-26, no 2, March 1980.

    Google Scholar 

  7. V. Pless "Symmetry codes over GF(3) and new 5 designs" Journal of Comb. Theory, 12, 1972, pp119–142.

    Google Scholar 

  8. A.Poli "Codes dans certaines algèbres modulaires" Thèse de Doctorat d'Etat, UPS Toulouse F, 1978.

    Google Scholar 

  9. A.Poli "Idéaux principaux nilpotents de dimension maximale dans l'algèbre IF G d'un groupe abèlien" Communications in Algebra, Sept. 1984,pp 391–401

    Google Scholar 

  10. A.Poli "Importante algebraic calculations for n variable codes" Discrete Math.,vol.56,no2–3,pp255–263.

    Google Scholar 

  11. A.Poli,C.Rigoni "Codes autoduaux 2k circulant sur IF (q impaire)" Revue TS,NS,vol.1,no2,pp211–217

    Google Scholar 

  12. M. Ventou, C. Rigoni "Self dual double circulant codes" Disc.Math., vol.56 no2–3 pp291–298 (1985).

    Google Scholar 

  13. M.Ventou "Contribution à l'étude des codes correcteurs polynomiaux" Thèse de spécialité, UPS Toulouse, 1984.

    Google Scholar 

  14. J. Wolfmann "A new construction of the binary extended Golay code using a group algebra" Discrete Math., 31, pp337–338 (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AAECC Lab., Université Paul Sabatier, 118 route de Narbonne, 31062, Toulouse cédex, France

    A. Poli & C. Rigoni

Authors
  1. A. Poli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Rigoni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poli, A., Rigoni, C. (1986). Enumeration of self dual 2k circulant codes. In: Poli, A. (eds) Applied Algebra, Algorithmics and Error-Correcting Codes. AAECC 1984. Lecture Notes in Computer Science, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16767-6_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-16767-6_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16767-9

  • Online ISBN: 978-3-540-38813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation