Singly-even self-dual codes and Hadamard matrices

Masaaki Harada, Vladimir D. Tonchev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 11th International Symposium, AAECC, Proceedings
EditorsGerard Cohen, Marc Giusti, Teo Mora
PublisherSpringer Verlag
Pages279-284
Number of pages6
ISBN (Print)9783540601142
Publication statusPublished - 1995 Jan 1
Externally publishedYes
Event11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995 - Paris, France
Duration: 1995 Jul 171995 Jul 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume948
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995
CountryFrance
CityParis
Period95/7/1795/7/22

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Singly-even self-dual codes and Hadamard matrices'. Together they form a unique fingerprint.

  • Cite this

    Harada, M., & Tonchev, V. D. (1995). Singly-even self-dual codes and Hadamard matrices. In G. Cohen, M. Giusti, & T. Mora (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 11th International Symposium, AAECC, Proceedings (pp. 279-284). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 948). Springer Verlag.