| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647706 | Discrete Mathematics | 2012 | 5 Pages |
Abstract
It is proved that the size of the symmetry group Sym(C) of every full rank perfect 1-error correcting binary code CC of length nn is less than or equal to 2|Sym(Hn)|/(n+1), where HnHn is a Hamming code of the same length.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Olof Heden,