Extremal self-dual codes of length 64 through neighbors and covering radii

被引：17
作者：
Chigira, Naoki
Harada, Masaaki [1 ]
Kitazume, Masaaki
机构：
[1] Yamagata Univ, Dept Math Sci, Yamagata 9908560, Japan
[2] Muroran Inst Technol, Dept Math Sci, Muroran, Hokkaido 0508585, Japan
[3] Chiba Univ, Dept Math & Informat, Chiba 2638522, Japan
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2007年 / 42卷 / 01期
关键词：
extremal self-dual code; neighbor; covering radius;
D O I：
10.1007/s10623-006-9018-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.
引用
收藏
页码：93 / 101
页数：9
相关论文
共 12 条
[1]  
[Anonymous], 1996, The CRC Handbook of Combinatorial Designs
[2]   ON THE COVERING RADIUS OF EXTREMAL SELF-DUAL CODES [J].
ASSMUS, EF ;
PLESS, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :359-363
[3]   WEIGHT ENUMERATORS OF SELF-DUAL CODES [J].
BRUALDI, RA ;
PLESS, VS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) :1222-1225
[4]  
CHIGIRA N, IN PRESS J ALGEBRA
[5]  
CHIGIRA N, UNPUB SOME SELF DUAL
[6]   A NEW UPPER BOUND ON THE MINIMAL DISTANCE OF SELF-DUAL CODES [J].
CONWAY, JH ;
SLOANE, NJA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1319-1333
[7]  
HARADA M, SHADOWS NEIGHBORS CO
[8]   On the classification and enumeration of self-dual codes [J].
Huffman, WC .
FINITE FIELDS AND THEIR APPLICATIONS, 2005, 11 (03) :451-490
[9]   UPPER BOUND FOR SELF-DUAL CODES [J].
MALLOWS, CL ;
SLOANE, NJA .
INFORMATION AND CONTROL, 1973, 22 (02) :188-200
[10]   Shadow bounds for self-dual codes [J].
Rains, EM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :134-139
12