On the number of 1-perfect binary codes: a lower bound Full article
| Journal |
IEEE Transactions on Information Theory
ISSN: 0018-9448 , E-ISSN: 1557-9654 |
||
|---|---|---|---|
| Output data | Year: 2008, Volume: 54, Number: 4, Pages: 1760-1765 Pages count : 6 DOI: 10.1109/tit.2008.917692 | ||
| Tags | Automorphism, lower bound, perfect binary codes | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
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.
Cite:
Krotov D.S.
, Avgustinovich S.V.
On the number of 1-perfect binary codes: a lower bound
IEEE Transactions on Information Theory. 2008. V.54. N4. P.1760-1765. DOI: 10.1109/tit.2008.917692 WOS Scopus РИНЦ OpenAlex
On the number of 1-perfect binary codes: a lower bound
IEEE Transactions on Information Theory. 2008. V.54. N4. P.1760-1765. DOI: 10.1109/tit.2008.917692 WOS Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Jul 26, 2007 |
| Published online: | Mar 21, 2008 |
Identifiers:
| Web of science: | WOS:000254475300029 |
| Scopus: | 2-s2.0-41949130681 |
| Elibrary: | 13590805 |
| OpenAlex: | W3121152837 |