Skip to main content

New Self-Dual Codes over GF(5)

  • Conference paper
  • First Online:
Cryptography and Coding (Cryptography and Coding 1999)

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

Included in the following conference series:

Abstract

Self-dual codes and orthogonal designs have been studied for a long time as separate research areas. In the present paper we show a strong relationship between them. The structure of orthogonal designs is such as to allow us a much faster and more systematic search for self-dual codes over GF(5).

Using our method we constructed the following linear self-dual codes over GF(5):(i) [4,2,2], (ii) [8,4,4], (iii) [12,6,6], (iv) [16,8,6], (v) [20,10,8], (vi) [24,12,9], (vii) [28,14,10]. The codes (i), (ii), (iii), (v) are extremal. A [28,14,10] code is constructed here for the first time.

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. J.H. Conway and N.J.A. Sloane, A new upper bound on the minimal distance of self-dual codes, IEEE Trans. Inform. Theory, 36 (1990), 1319–1333.

    Article  MathSciNet  Google Scholar 

  2. A.V. Geramita, J.M. Geramita, and J. Seberry Wallis, Orthogonal designs, Linear and Multilinear Algebra, 3 (1976), 281–306.

    Article  MathSciNet  Google Scholar 

  3. A.V. Geramita, and J. Seberry, Orthogonal designs: Quadratic forms and Hadamard matrices, Marcel Dekker, New York-Basel, 1979.

    MATH  Google Scholar 

  4. M. Harada, Double circulant self-dual codes over GF(5), Ars Combinatoria, to appear.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  6. F.J. MacWilliams and N.J.A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam, 1977.

    Google Scholar 

  7. E. Rains and N.J.A. Sloane, Self-dual codes, in Handbook of Coding Theory, eds. V. Pless et al., Elsevier, Amsterdam, 1998.

    Google Scholar 

  8. V.D Tonchev, Codes, in The CRC Handbook of Combinatorial Designs, ed. C.J. Colbourn and J.H. Dinitz, CRC Press, Boca Raton, Fla., 1996, 517–543.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Georgiou, S., Koukouvinos, C. (1999). New Self-Dual Codes over GF(5). In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics