Geodesic
A survey of methods for constructing nonlinear perfect binary codes
Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 4, pp. 60-88

Voir la notice de l'article provenant de la source Math-Net.Ru

The theory of perfect codes is an area at the juncture of coding theory and design theory which is rather hard to explore. Linear perfect codes were constructed by M. Golay and R. Hamming in the end of the 1940s. Nonlinear perfect codes were discovered by Yu. L. Vasil'ev in 1961. At present, many different methods are known for constructing perfect codes. This article presents a survey of the methods for constructing nonlinear perfect binary codes alongside some open questions of the theory of perfect codes. 
@article{DA_2006_13_4_a5,
     author = {A. M. Romanov},
     title = {A survey of methods for constructing nonlinear perfect binary codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {60--88},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2006_13_4_a5/}
}
TY  - JOUR
AU  - A. M. Romanov
TI  - A survey of methods for constructing nonlinear perfect binary codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2006
SP  - 60
EP  - 88
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2006_13_4_a5/
LA  - ru
ID  - DA_2006_13_4_a5
ER  - 
%0 Journal Article
%A A. M. Romanov
%T A survey of methods for constructing nonlinear perfect binary codes
%J Diskretnyj analiz i issledovanie operacij
%D 2006
%P 60-88
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2006_13_4_a5/
%G ru
%F DA_2006_13_4_a5
A. M. Romanov. A survey of methods for constructing nonlinear perfect binary codes. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 4, pp. 60-88. http://geodesic.mathdoc.fr/item/DA_2006_13_4_a5/