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 条

[31] A Lower Bound for Burst Error Correcting Capability of Low Rate Binary Cyclic Codes
Vafi, Sina
Majid, Narges Rezvani
IEEE COMMUNICATIONS LETTERS, 2016, 20 (01) : 33 - 36
[32] Perfect binary codes with trivial automorphism group
Avgustinovich, SV
Solov'eva, FI
1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 114 - 115
[33] On enumeration of the perfect binary codes of length 15
Malyugin, SA
DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 161 - 181
[34] Local and interweight spectra of perfect binary codes
Vasil'eva, AY
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 474 - 474
[35] On nonsystematic perfect binary codes of length 15
Romanov, AM
DISCRETE APPLIED MATHEMATICS, 2004, 135 (1-3) : 255 - 258
[36] Obtaining Binary Perfect Codes Out of Tilings
Miyamoto, Gabriella Akemi
Firer, Marcelo
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (10) : 6121 - 6132
[37] Rank Spectrum of Propelinear Perfect Binary Codes
Guskov, George K.
Mogilnykh, Ivan Yu.
Solov'eva, Faina I.
2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 879 - +
[38] Intersection matrices for partitions by binary perfect codes
Avgustinovich, SV
Lobstein, AC
Solov'eva, FI
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) : 1621 - 1624
[39] THE HAMMING BOUND FOR BINARY ARITHMETIC AN CODES
ERNVALL, S
ARS COMBINATORIA, 1985, 20B : 207 - 227
[40] On the number of perfect binary quadratic forms
Aicardi, F
EXPERIMENTAL MATHEMATICS, 2004, 13 (04) : 451 - 457

← 1 2 3 4 5 →