On a lower bound on the number of perfect binary codes

被引：3

作者：

Malyugin, SA ^{[1
]}

机构：

[1] Sobolev Inst Math, Novosibirsk 630090, Russia

来源：

DISCRETE APPLIED MATHEMATICS | 2004年 / 135卷 / 1-3期

关键词：

perfect binary codes; lower bounds; i-Component;

D O I：

10.1016/S0166-218X(02)00302-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：157 / 160

页数：4

共 50 条

[1] On the number of 1-perfect binary codes: A lower bound
Krotov, Denis S.
Avgustinovich, Sergey V.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (04) : 1760 - 1765
[2] A lower bound for the number of transitive perfect codes
Potapov V.N.
Journal of Applied and Industrial Mathematics, 2007, 1 (3) : 373 - 379
[3] A Lower Bound on the Number of Perfect Matchings in Benzenoid Systems
Zhang, Fuji
Lin, Yuqing
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2021, 85 (01) : 7 - 11
[4] An upper bound for the number of uniformly packed binary codes
Tokareva N.N.
Journal of Applied and Industrial Mathematics, 2008, 2 (3) : 426 - 431
[5] On perfect binary codes
Solov'eva, Faina I.
DISCRETE APPLIED MATHEMATICS, 2008, 156 (09) : 1488 - 1498
[6] New Lower Bound on the Number of Perfect Matchings in Fullerene Graphs
Heping Zhang
Fuji Zhang
Journal of Mathematical Chemistry, 2001, 30 : 343 - 347
[7] New lower bound on the number of perfect matchings in fullerene graphs
Zhang, HP
Zhang, FJ
JOURNAL OF MATHEMATICAL CHEMISTRY, 2001, 30 (03) : 343 - 347
[8] A NEW LOWER BOUND ON THE NUMBER OF PERFECT MATCHINGS IN CUBIC GRAPHS
Kral', Daniel
Sereni, Jean-Sebastien
Stiebitz, Michael
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1465 - 1483
[9] A new lower bound for the number of perfect matchings of line graph
Zhou, Xue
INFORMATION PROCESSING LETTERS, 2015, 115 (02) : 269 - 274
[10] Lower bound of covering radius of binary irreducible Goppa codes
Sergey Bezzateev
Natalia Shekhunova
Designs, Codes and Cryptography, 2017, 82 : 69 - 76

← 1 2 3 4 5 →