On Two Doubly Even Self-Dual Binary Codes of Length<tex>$160$</tex>and Minimum Weight<tex>$24$</tex>
Lists
Only you see this
Abstract
This correspondence revisits the idea of constructing a binary [mn,mk] code from an [n,k] code over F/sub 2//sup m/ by concatenating the code with a suitable basis representation of F/sub 2//sup m/ over F/sub 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.
BibTeX
@article{dijk2005two,
author = {Marten van Dijk and Sebastian Egner and Marcus Greferath and Alfred Wassermann},
title = {{On Two Doubly Even Self-Dual Binary Codes of Length\<tex\>$160$\</tex\>and Minimum Weight\<tex\>$24$\</tex\>}},
journal = {IEEE Trans. Information Theory},
year = {2005},
doi = {10.1109/tit.2004.839535},
}Loading related content...