TY - JOUR
T1 - On two doubly even self-dual binary codes of length 160 and minimum weight 24
AU - van Dijk, M.
AU - Egner, S.
AU - Greferath, M.
AU - Wassermann, A.
PY - 2005/1
Y1 - 2005/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/12444347515
UR - https://www.scopus.com/inward/citedby.url?scp=12444347515&partnerID=8YFLogxK
U2 - 10.1109/TIT.2004.839535
DO - 10.1109/TIT.2004.839535
M3 - Article
SN - 0018-9448
VL - 51
SP - 408
EP - 411
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
ER -