Propelinear codes related to some classes of optimal codes |
| |
Authors: | I Yu Mogilnykh F I Solov’eva |
| |
Affiliation: | 1.Sobolev Institute of Mathematics,Branch of the Russian Academy of Sciences,Novosibirsk,Russia |
| |
Abstract: | A code is said to be propelinear if its automorphism group contains a subgroup that acts regularly on codewords. We show propelinearity of complements of cyclic codes C 1,i , (i, 2 m ? 1) = 1, of length n = 2 m ? 1, including the primitive two-error-correcting BCH code, to the Hamming code; the Preparata code to the Hamming code; the Goethals code to the Preparata code; and the Z4-linear Preparata code to the Z4-linear perfect code. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|