Weight enumerators of extremal singly-even [60, 30, 12] codes

被引：15

作者：

Gulliver, TA ^{[1
]}

Harada, M ^{[1
]}

机构：

[1] OKAYAMA UNIV,DEPT MATH,OKAYAMA 700,JAPAN

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1996年 / 42卷 / 02期

关键词：

extremal self-dual codes; double circulant codes;

D O I：

10.1109/18.485739

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Conway and Sloane have listed the possible weight enumerators for extremal self-dual codes up to length 72. In this correspondence, we construct extremal singly-even self-dual [60, 30, 12] codes whose weight enumerator does not appear in this list. In addition, we present the possible weight enumerators for extremal self-dual codes of length 60.

引用

页码：658 / 659

页数：2

共 9 条

[1] WEIGHT ENUMERATORS OF SELF-DUAL CODES
BRUALDI, RA
PLESS, VS
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (04) : 1222 - 1225
[2] A NEW UPPER BOUND ON THE MINIMAL DISTANCE OF SELF-DUAL CODES
CONWAY, JH
SLOANE, NJA
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) : 1319 - 1333
[3] GULLIVER TA, 1989, THESIS U VICTORIA VI
[4] HARADA M, UNPUB CLASSIFICATION
[5] HARADA M, UNPUB EXTREMAL SELF
[6] HARADA M, IN PRESS DES CODES C
[7] MacWilliams F.J., 1986, The Theory of Error-Correcting Codes
[8] MacWilliams F. J., 1971, J COMB THEORY, V10, P1
[9] YORGOV V, 1994, PROBL INFORM TRANSM, V29, P385

← 1 →