|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 4, Pages 60–88
(Mi da12)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
A survey of methods for constructing nonlinear perfect binary codes
A. M. Romanov Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
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.
Citation:
A. M. Romanov, “A survey of methods for constructing nonlinear perfect binary codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006), 60–88; J. Appl. Industr. Math., 2:2 (2008), 252–269
Linking options:
https://www.mathnet.ru/eng/da12 https://www.mathnet.ru/eng/da/v13/s1/i4/p60
|
Statistics & downloads: |
Abstract page: | 483 | Full-text PDF : | 261 | References: | 57 |
|