Every finite group is the automorphism group of some perfect code
Journal of Combinatorial Theory Series A
A generalized parity function and its use in the construction of perfect codes
SIAM Journal on Algebraic and Discrete Methods
A binary perfect code of length 15 and codimension 0
Designs, Codes and Cryptography
Kernels of nonlinear Hamming codes
Designs, Codes and Cryptography
On Perfect Codes and Tilings: Problems and Solutions
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Switching Equivalence Classes of Perfect Codes
Designs, Codes and Cryptography
Perfect binary codes: bounds and properties
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
On Perfect Codes and Related Concepts
Designs, Codes and Cryptography
Inductive Constructions of Perfect Ternary Constant-Weight Codes with Distance 3
Problems of Information Transmission
On Perfect Codes: Rank and Kernel
Designs, Codes and Cryptography
Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction
Problems of Information Transmission
On the Ranks and Kernels Problem for Perfect Codes
Problems of Information Transmission
On a lower bound on the number of perfect binary codes
Discrete Applied Mathematics
On nonsystematic perfect binary codes of length 15
Discrete Applied Mathematics
Local spectra of perfect binary codes
Discrete Applied Mathematics
Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction
Problems of Information Transmission
Construction of Perfect q-ary Codes by Sequential Switchings of \tilde{\alpha}-Components
Problems of Information Transmission
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
SIAM Journal on Discrete Mathematics
Classification of Steiner quadruple systems of order 16 and rank at most 131
Problems of Information Transmission
On the Structure of Symmetry Groups of Vasil'ev Codes
Problems of Information Transmission
On the mathematical theory of error-correcting codes
IBM Journal of Research and Development
Translation-invariant propelinear codes
IEEE Transactions on Information Theory
Intersection matrices for partitions by binary perfect codes
IEEE Transactions on Information Theory
Perfect binary codes: constructions, properties, and enumeration
IEEE Transactions on Information Theory
The perfect binary one-error-correcting codes of length 15: part II-properties
IEEE Transactions on Information Theory
On switching equivalence of n-ary quasigroups of order 4 and perfect binary codes
Problems of Information Transmission
On weight distributions of perfect colorings and completely regular codes
Designs, Codes and Cryptography
| Hi-index | 0.10 |
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 @a-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.