On the classification of perfect codes: Extended side class structures |
| |
| Authors: | Olof Heden Martin Hessler |
| |
| Institution: | a Department of Mathematics, KTH, S-100 44 Stockholm, Sweden
b Department of Mathematics, University of Linköping, S-581 83 Linköping, Sweden |
| |
| Abstract: | 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 word  such that  . Hessler defined C and C′ to be linearly equivalent if there exists a non-singular 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 word  such that |
| |
| Keywords: | Perfect codes Side class structures |
| 本文献已被 ScienceDirect 等数据库收录！ |
