The paper proves that there exists an exponential number of nonequivalent pro- pelinear 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.
|Journal||Electronic Journal of Combinatorics|
|Publication status||Published - 24 May 2013|
- Binary codes
- Extended perfect codes
- Normalized propelinear structures
- Propelinear codes