Structure of i-components of perfect binarycodes

Special components of perfect binarycodes are investigated. We call such components i-components. A class of perfect codes of length n with minimal i-components of cardinality( k + 1)2 n−k =(n + 1) for every n =2 s − 1 ;s ?2 and k =2 r − 1; where r =2 ;:::;s− 1 is constructed. The existence of maximal cardinalitynonisomorphic i-components of di4erent perfect codes of length n for all n =2 s − 1 ;s ?3; is proved. ? 2001 Elsevier Science B.V.

[1]  K. T. Phelps,et al.  A Combinatorial Construction of Perfect Codes , 1983 .

[2]  Juriaan Simonis,et al.  On Generator Matrices of Codes , 1992, IEEE Transactions on Information Theory.

[3]  Olof Heden,et al.  A New Construction of Group and Nongroup Perfect Codes , 1977, Inf. Control..