Perfect codes as isomorphic spaces |
| |
Authors: | Martin Hessler |
| |
Institution: | Royal Institute of Technology, SE-105 71 Stockholm, Sweden |
| |
Abstract: | Linear equivalence between perfect codes is defined. This definition gives the concept of general perfect 1-error correcting binary codes. These are defined as 1-error correcting perfect binary codes, with the difference that the set of errors is not the set of weight one words, instead any set with cardinality n and full rank is allowed. The side class structure defines the restrictions on the subspace of any general 1-error correcting perfect binary code. Every linear equivalence class will contain all codes with the same length, rank and dimension of kernel and all codes in the linear equivalence class will have isomorphic side class structures. |
| |
Keywords: | Perfect codes Dual codes Classification |
本文献已被 ScienceDirect 等数据库收录! |
|