Skip to main content
SpringerLink
Log in

Singly-even self-dual codes and Hadamard matrices

  • Submitted Contributions
  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 1995)

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

Abstract

A construction of binary self-dual singly-even codes from Hadamard matrices is described. As an application, all inequivalent extremal singly-even [40,20,8] codes derived from Hadamard matrices of order 20 are enumerated.

Research partially supported by NSA Research Grant MDA904-95-H-1019

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. E.F. Assmus, Jr., and H.F. Mattson, Jr., New 5-designs, J. Combin. Theory 6 (1969), 122–151.

    Google Scholar 

  2. F.C. Bussemaker and V.D. Tonchev, New extremal doubly-even codes of length 56 derived from Hadamard matrices of order 28, Discrete Math. 76 (1989), 45–49.

    Google Scholar 

  3. F.C. Bussemaker and V.D. Tonchev, Extremal doubly-even codes of length 40 derived from Hadamard matrices of order 20, Discrete Math. 82 (1990), 317–321.

    Google Scholar 

  4. S. Buyuklieva and V. Yorgov, Singly-even dual codes of length 40, Proc. ACCT4 '94, Novgorod, Russia, 1994, 60–61.

    Google Scholar 

  5. P.J. Cameron and J.H. van Lint, Graphs, Codes and Designs, Cambridge University Press, Cambridge, 1980.

    Google Scholar 

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

    Google Scholar 

  7. M. Hall, Jr., Hadamard matrices of order 20, Jet Propulsion Laboratory Technical Report No. 32–761, 1965.

    Google Scholar 

  8. M. Harada, Weighing matrices and self-dual codes, Ars Combinatoria, (to appear).

    Google Scholar 

  9. H. Kimura, Extremal doubly even (56,28,12) codes and Hadamard matrices of order 28, Australasian J. Combin. 10 (1994), 153–161. to appear.

    Google Scholar 

  10. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.

    Google Scholar 

  11. V.D. Tonchev, Combinatorial Configurations, Longman Scientific and Technical, Wiley, New York, 1988.

    Google Scholar 

  12. V.D. Tonchev, Self-orthogonal designs and extremal doubly-even codes, J. Combin. Theory Ser. A 52 (1989), 197–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Okayama University, 700, Okayama, Japan

    Masaaki Harada

  2. Mathematical Sciences, Michigan Technological University, 49931, Houghton, MI, USA

    Vladimir D. Tonchev

Authors
  1. Masaaki Harada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir D. Tonchev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Marc Giusti Teo Mora

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harada, M., Tonchev, V.D. (1995). Singly-even self-dual codes and Hadamard matrices. In: Cohen, G., Giusti, M., Mora, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1995. Lecture Notes in Computer Science, vol 948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60114-7_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-60114-7_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60114-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation