Skip to main content

Self-dual Codes over Small Prime Fields from Combinatorial Designs

  • Conference paper
Algebraic Informatics (CAI 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5725))

Included in the following conference series:

  • 416 Accesses

Abstract

In this paper, we give some new extremal ternary self-dual codes which are constructed by skew-Hadamard matrices. This has been achieved with the aid of a recently presented modification of a known construction method. In addition, we survey the known results for self-dual codes over GF(5) constructed via combinatorial designs, i.e. Hadamard and skew-Hadamard matrices, and we give a new self-dual code of length 72 and dimension 36 whose minimum weight is 16 over GF(5) for the first time. Furthermore, we give some properties of the generated self-dual codes interpreted in terms of algebraic coding theory, such as the orders of their automorphism groups and the corresponding weight enumerators.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arasu, K.T., Gulliver, T.A.: Self-dual codes over \(\mathbb{F}_p\) and weighing matrices. IEEE Trans. Inform. Theory 47, 2051–2055 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Assmus Jr., E.F., Mattson Jr., H.F.: New 5-designs. J. Combin. Theory Ser. A 6, 122–151 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bosma, W., Cannon, J.: Handbook of Magma Functions. Version 2.9, Sydney (2002)

    Google Scholar 

  4. Brouwer, A.E.: Bounds on linear codes. In: Pless, V., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 295–461. Elsevier, Amsterdam (1998)

    Google Scholar 

  5. Dougherty, S.T., Gulliver, T.A., Harada, M.: Optimal formally self-dual codes over \(\mathbb{F}_5\) and \(\mathbb{F}_7\). Appl. Algebra Engrg. Comm. Comput. 10, 227–236 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gaborit, P.: Quadratic double circulant codes over fields. J. Combin. Theory Ser. A 97, 85–107 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gaborit, P.: Tables of self-dual codes, http://www.unilim.fr/pages_perso/philippe.gaborit/SD

  8. Gaborit, P., Otmani, A.: Experimental constructions of self-dual codes. Finite Fields Appl. 9, 372–394 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Georgiou, S., Koukouvinos, C., Lappas, E.: Self-dual codes over some prime fields constructed from skew-Hadamard matrices. J. Discrete Math. Sci. Cryptogr. 10, 255–266 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Geramita, A.V., Seberry, J.: Orthogonal Designs. Quadratic Forms and Hadamard Matrices. Lecture Notes in Pure and Applied Mathematics, 45. Marcel Dekker, Inc., New York (1979)

    Google Scholar 

  11. Grassl, M.: Searching for linear codes with large minimum distance. In: Bosma, W., Cannon, J. (eds.) Discovering Mathematics with Magma. Springer, Heidelberg (2006)

    Google Scholar 

  12. Grassl, M.: Bounds on the minimum distance of linear codes, http://www.codetables.de

  13. Gulliver, T.A., Harada, M.: New optimal self-dual codes over GF(7). Graphs Combin. 15, 175–186 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gulliver, T.A., Harada, M.: Double circulant self-dual codes over GF(5). Ars Comb. 56, 3–13 (2000)

    MathSciNet  MATH  Google Scholar 

  15. Gulliver, T.A., Harada, M.: On the minimum weight of codes over \(\mathbb{F}_5\) constructed from certain conference matrices. Des. Codes Cryptogr. 31, 139–145 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gulliver, T.A., Harada, M., Miyabayashi, H.: Double circulant self-dual codes over \(\mathbb{F}_5\) and \(\mathbb{F}_7\). Adv. Math. Commun. 1, 223–238 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Han, S., Kim, J.-L., Lee, H., Lee, Y.: Cubic self-dual codes based on building-up constructions (preprint)

    Google Scholar 

  18. Harada, M.: New extremal ternary self–dual codes. Austral. J. Combin. 17, 133–145 (1998)

    MathSciNet  MATH  Google Scholar 

  19. Harada, M., Munemasa, A.: There exists no self-dual [24,12,10] code over \(\mathbb{F}_5\). Des. Codes Cryptogr. 52, 125–127 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Harada, M., Östergård, P.R.J.: On the classification of self-dual codes over \(\mathbb{F}_5\). Graphs Combin 19, 203–214 (2003)

    MathSciNet  Google Scholar 

  21. Kim, J.-L., Han, S.: On self-dual codes over \(\mathbb{F}_5\). Des. Codes Cryptogr. 48, 43–58 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kim, J.-L., Sole, P.: Skew Hadamard designs and their codes. Des. Codes Cryptogr. 49, 135–145 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Kotsireas, I.S., Koukouvinos, C.: New skew-Hadamard matrices via computational algebra. Australas. J. Combin. 41, 235–248 (2008)

    MathSciNet  MATH  Google Scholar 

  24. Kotsireas, I.S., Koukouvinos, C., Simos, D.E.: MDS and near-MDS self-dual codes over large prime fields (submitted for publication)

    Google Scholar 

  25. Koukouvinos, C.: Hadamard matrices of order 4t, t odd positive integer, http://www.math.ntua.gr/~ckoukouv

  26. Koukouvinos, C., Simos, D.E.: Construction of new self-dual codes over GF(5) using skew-Hadamard matrices (to appear in Adv. Math. Commun.)

    Google Scholar 

  27. Koukouvinos, C., Stylianou, S.: On skew-Hadamard matrices. Discrete Math. 308, 2723–2731 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Leon, J.S., Pless, V., Sloane, N.J.A.: Self-dual codes over GF(5). J. Combin. Theory Ser. A 32, 178–194 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  29. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  30. MacWilliams, F.J., Mallows, C.L., Sloane, N.J.A.: Generalizations of Gleason’s theorem on weight enumerators of self-dual codes. IEEE Trans. Inform. Theory 18, 794–805 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  31. Nebe, G., Rains, E.M., Sloane, N.J.A.: Self-dual codes and invariant theory. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  32. Pless, V.S., Huffman, W.C., Brualdi, R.A.: An introduction to algebraic codes. In: Pless, V., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 295–461. Elsevier, Amsterdam (1998)

    Google Scholar 

  33. Rains, E.M., Sloane, N.J.A.: Self-dual codes. In: Pless, V., Huffman, W.C. (eds.) Handbook of Coding Theory, pp. 177–294. Elsevier, Amsterdam (1998)

    Google Scholar 

  34. Sloane, N.J.A.: Self-dual codes and lattices, Relations between combinatorics and other parts of mathematics. In: Proceedings of Symposium on pure mathematics, pp. 273–308. American Mathematics Society, Providence (1979)

    Google Scholar 

  35. Tonchev, V.D.: Codes. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, pp. 517–543. CRC Press, Boca Raton (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koukouvinos, C., Simos, D.E. (2009). Self-dual Codes over Small Prime Fields from Combinatorial Designs. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03564-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03563-0

  • Online ISBN: 978-3-642-03564-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics