论文信息 - On the reconstruction of perfect codes - 字舞流文

On the reconstruction of perfect codes

We show how to reconstruct a perfect 1-error correcting binary code of length n from the code words of weight (n+ 1)/2.

[1] Jan-Erik Roos. An Algebraic Study of Group and Nongroup Error-Correcting Codes , 1965, Inf. Control..

[2] H. S. Shapiro,et al. On the Mathematical Theory of Error-Correcting Codes , 1959, IBM J. Res. Dev..

[3] Faina I. Solov'eva. Perfect binary codes: bounds and properties , 2000, Discret. Math..

[4] Olof Heden,et al. A generalized Lloyd theorem and mixed perfect codes. , 1975 .

[5] S. V. Avgustinovich. On a Property of Perfect Binary Codes , 1997 .