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

M. van Dijk, S. Egner, M. Greferath, A. Wassermann

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

This correspondence revisits the idea of constructing a binary [mn, mk] code from an [n, k] code over F2m by concatenating the code with a suitable basis representation of F2m 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. © 2005 IEEE.
Original languageEnglish
Pages (from-to)408-411
JournalIEEE Transactions on Information Theory
Volume51
Issue number1
DOIs
Publication statusPublished - Jan 2005
Externally publishedYes

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