On two doubly even self-dual binary codes of length 160 and minimum weight 24

Marten van Dijk, Sebastian Egner, Marcus Greferath, Alfred Wassermann

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This correspondence revisits the idea of constructing a binary [mn, mk] code from an [n, k] code over F-2m by concatenating the code with a suitable basis representation of F-2m over F-2. We construct two nonequivalent examples of doubly even self-dual binary codes of length 160 which turn out to be of minimum distance 24. This improves the lower bound for this class of codes, whereas the upper bound is given by 28. The construction at hand seems to be of interest beyond this particular example.

Original languageEnglish
Pages (from-to)408-411
Number of pages4
JournalIEEE Transactions on Information Theory
Volume51
Issue number1
DOIs
Publication statusPublished - Jan 2005
MoE publication typeA1 Journal article-refereed
EventIEEE International Symposium on Information Theory - Yokohama, Japan
Duration: 29 Jun 20034 Jul 2003

Keywords

  • block codes
  • dual codes
  • linear codes

Fingerprint Dive into the research topics of 'On two doubly even self-dual binary codes of length 160 and minimum weight 24'. Together they form a unique fingerprint.

Cite this