Title of article
On perfect binary codes Original Research Article
Author/Authors
Faina I. Solov’eva، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
11
From page
1488
To page
1498
Abstract
Some results on perfect codes obtained during the last 6 years are discussed. The main methods to construct perfect codes such as the method of image-components and the concatenation approach and their implementations to solve some important problems are analyzed. The solution of the ranks and kernels problem, the lower and upper bounds of the automorphism group order of a perfect code, spectral properties, diameter perfect codes, isometries of perfect codes and codes close to them by close-packed properties are considered.
Keywords
Diameter perfect codes , Isometries of uniformly packed code , Concatenation methods , Automorphism group of perfect codes , Switching methods , Ranks and kernel problem for perfect codes , Perfect codes
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886752
Link To Document