论文信息 - A New Construction of Group and Nongroup Perfect Codes

A New Construction of Group and Nongroup Perfect Codes

From two perfect 1-codes C ′ and C ′′ in cartesian products S ′ respective S ′′ we shall construct a perfect 1-code C in a cartesian product S . We shall show how the codes C ′ and C ′′ might be chosen so that the code C will be equivalent respective not equivalent to a subgroup of S . We shall also give an example of a perfect 1-code that is not equivalent to any “Vasilev” code.

Olof Heden | O. Heden

[1] J. Schönheim,et al. Group Partition, Factorization and the Vector Covering Problem , 1972, Canadian Mathematical Bulletin.

[2] Jacobus H. van Lint,et al. Coding Theory , 1971 .

[3] M. Herzog,et al. Linear and Nonlinear Single-Error-Correcting Perfect Mixed Codes , 1971, Inf. Control..

[4] Bernt Lindström. Group Partitions and Mixed Perfect Codes , 1975, Canadian Mathematical Bulletin.

[5] J. Schnheim,et al. On linear and nonlinear single-error-correcting q-nary perfect codes , 1968 .

[6] Bernt Lindström,et al. On Group and Nongroup Perfect Codes in $q$ Symbols. , 1969 .