A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the classification of perfect codes: Extended side class structures
2010
Discrete Mathematics
The two 1-error correcting perfect binary codes, C and C are said to be equivalent if there exists a permutation π of the set of the n coordinate positions and a wordd such that C = π (d + C ). Hessler defined C and C to be linearly equivalent if there exists a nonsingular linear map ϕ such that C = ϕ(C). Two perfect codes C and C of length n will be defined to be extended equivalent if there exists a non-singular linear map ϕ and a wordd such that Heden and Hessler, associated with each linear
doi:10.1016/j.disc.2009.07.023
fatcat:767jnbrrxvfilffemlgoimezmy