1
N Steiner triple systems and perfect codes, Master of Sci.
thesis, 1993, Royal Institute of Technology, Stockholm, Sweden.
2
Heden O. A binary perfect code of length 15 and codimension 0,
Designs, Codes and Cryptography. 1994. V.4. P. 213-220.
3
Etzion T., Vardy A., Perfect binary codes: Constructions,
properties and enumeration, IEEE Trans. Inform. Theory, 1994.
V. 40. N. 3. P. 754-763.
4
Phelps K.T., LeVan M.J., Kernels of nonlinear
Hamming codes,
Designs, Codes and Cryptography, 1995. V. 6. P. 247-257.
5
Avgustinovich S. V., Solov'eva F. I.
Perfect binary codes with trivial automorphism group,
Proc. of Int. Workshop on Information Theory, Killarney, Ireland.
June. 1998. P. 114-115.
6
Malyugin S. A. Perfect codes with trivial automorphism group,
Proc. Second Int. Workshop on Optimal Codes and Related Topics.
Sozopol, Bulgaria. June. 1998. P. 163-167.
7
Etzion T., Vardy A., On perfect codes and tilings: problems
and solutions, SIAM J. Discrete Math., 1998. V. 11. N. 2. P. 205-223.
8
Phelps K.T., Villanueva M. ,
On perfect codes: rank and kernel,
Designs, Codes and Cryptography, to appear.
9
Phelps K. T. , An enumeration of 1-perfect binary codes of length 15,
Australasian Journal of Combinatorics, 2000. V. 21. P. 287-298.
10
Avgustinovich S. V., Heden O., Solov'eva F. I.
The classification of some perfect codes, submitted.
11
Avgustinovich S. V., Heden O., Solov'eva F. I.
On ranks and kernels of perfect codes, submitted.
12
Vasil'ev Y.L., On nongroup close-packed codes,
Problems of Cybernetics 8 (1962) 375-378 (in Russian).
© 2001, Сибирское отделение Российской академии наук, Новосибирск
slund M. Steiner triple systems and perfect codes, Master of Sci.
thesis, 1993, Royal Institute of Technology, Stockholm, Sweden.
Ваши комментарии
![[SBRAS]](/gif/s_sigma.gif)