On the number of nonequivalent propelinear extended perfect codes (Q1953526)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of nonequivalent propelinear extended perfect codes |
scientific article |
Statements
On the number of nonequivalent propelinear extended perfect codes (English)
0 references
7 June 2013
0 references
Summary: The paper proves that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov (2007) are propelinear. All such codes have small rank, which is one more than the rank of the extended Hamming code of the same length. We investigate the properties of these codes and show that any of them has a normalized propelinear representation.
0 references
binary codes
0 references
extended perfect codes
0 references
normalized propelinear structures
0 references
propelinear codes
0 references