On the number of 1-perfect binary codes: A lower bound

被引：13

作者：

Krotov, Denis S. ^{[1
]}

Avgustinovich, Sergey V. ^{[1
]}

机构：

[1] Sobolev Inst Math, Novosibirsk 630090, Russia

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 04期

关键词：

automorphism; lower bound; perfect binary codes;

D O I：

10.1109/TIT.2008.917692

中图分类号：

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

学科分类号：

0812 ;

摘要：

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

引用

页码：1760 / 1765

页数：6

共 50 条

[1] On a lower bound on the number of perfect binary codes
Malyugin, SA
[J]. DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 157 - 160
[2] On the binary codes with parameters of doubly-shortened 1-perfect codes
Denis S. Krotov
[J]. Designs, Codes and Cryptography, 2010, 57 : 181 - 194
[3] On the binary codes with parameters of triply-shortened 1-perfect codes
Denis S. Krotov
[J]. Designs, Codes and Cryptography, 2012, 64 : 275 - 283
[4] On the binary codes with parameters of doubly-shortened 1-perfect codes
Krotov, Denis S.
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2010, 57 (02) : 181 - 194
[5] On the binary codes with parameters of triply-shortened 1-perfect codes
Krotov, Denis S.
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2012, 64 (03) : 275 - 283
[6] Multifold 1-perfect codes
Krotov, Denis S.
[J]. JOURNAL OF COMBINATORIAL DESIGNS, 2024, 32 (09) : 546 - 555
[7] A lower bound for the number of transitive perfect codes
Potapov V.N.
[J]. Journal of Applied and Industrial Mathematics, 2007, 1 (3) : 373 - 379
[8] On binary 1-perfect additive codes: Some structural properties
Phelps, KT
Rifa, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (09) : 2587 - 2592
[9] A characterization of 1-perfect additive codes
Borges, J
Rifà, J
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) : 1688 - 1697
[10] The Algebraic Degree of 1-Perfect Binary Codes and a Relation with the Code Characters
Popescu, Dan C.
[J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 624 - 628

← 1 2 3 4 5 →