TY - JOUR
T1 - Extremal self-dual codes with the smallest covering radius
AU - Harada, Masaaki
AU - Ozeki, Michio
PY - 2000/3/28
Y1 - 2000/3/28
N2 - In this note, an extremal doubly-even [40, 20, 8] code with covering radius 7 is given. This code is the first extremal doubly-even code whose covering radius does not meet the Delsarte bound. Extremal singly-even codes with the smallest covering radius are also given. One of them is an extremal singly-even [44, 22, 8] code with covering radius 7, which determines t[43, 22] = 6 by puncturing.
AB - In this note, an extremal doubly-even [40, 20, 8] code with covering radius 7 is given. This code is the first extremal doubly-even code whose covering radius does not meet the Delsarte bound. Extremal singly-even codes with the smallest covering radius are also given. One of them is an extremal singly-even [44, 22, 8] code with covering radius 7, which determines t[43, 22] = 6 by puncturing.
UR - http://www.scopus.com/inward/record.url?scp=0009065096&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0009065096&partnerID=8YFLogxK
U2 - 10.1016/S0012-365X(99)00318-0
DO - 10.1016/S0012-365X(99)00318-0
M3 - Article
AN - SCOPUS:0009065096
SN - 0012-365X
VL - 215
SP - 271
EP - 281
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -