WEIGHT ENUMERATORS OF MORE IRREDUCIBLE CYCLIC BINARY-CODES

被引：2

作者：

WARD, RL ^{[1
]}

机构：

[1] NATL SECUR AGCY,FT GEORGE G MEADE,MD

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1993年 / 39卷 / 05期

关键词：

CYCLIC CODES; ERROR-CORRECTING CODES; ALGEBRAIC NUMBER THEORY; WEIGHT ENUMERATOR; STICKELBERGERS THEOREM;

D O I：

10.1109/18.259661

中图分类号：

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

学科分类号：

0812 ;

摘要：

The weight enumerators of all nondegenerate irreducible cyclic binary (n, k)-codes have been computed for which k > 27 and N = (2(k) - 1)/n < 500. The methods used are those developed by McEliece and further expanded by Ward and Segal, using algebraic number theory and Stickelberger's theorem.

引用

页码：1701 / 1709

页数：9