|
|||||
|
|
On perfect binary codes |
|
| Authors: | Faina I. Solov&#x eva |
| Affiliation: | aSobolev Institute of Mathematics, pr. Koptyuga 4, Novosibirsk State University, Pirogova street 4, Novosibirsk, Russia |
| 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 -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: | Perfect codes Switching methods Concatenation methods Automorphism group of perfect codes Ranks and kernel problem for perfect codes Isometries of uniformly packed code Diameter perfect codes |
| 本文献已被 ScienceDirect 等数据库收录！ | |