A lower bound on the number of nonequiva-lent propelinear extended perfect codes ∗

@inproceedings{Borges2012ALB,
  title={A lower bound on the number of nonequiva-lent propelinear extended perfect codes ∗},
  author={Joaquim Borges and Josep Rif{\`a}},
  year={2012}
}
In this paper we prove that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. All such codes have small rank, which is one unit greater than the dimension of the extended Hamming code of the same length. We investigate the properties of these codes. 

Topic