[1] Astola J.: The theory of Lee-codes. (research report), Lappeenranta, Lappeenranta Univ. of Technology, 1982.

[2] Best M. R.: A contribution to the nonexistence of perfect codes. (academisch proefschrift), Amsterdam, Math-Centrum, 1982. MR 0726757

[3] Biggs N.: Perfect codes in graphs. J. Combin. Theory Ser. B 15 (1973), 289-296. MR 0325457 | Zbl 0256.94009

[4] Cameron P. J., Thas J. A., Payne S. E.: Polarities of generalized hexagons and perfect codes. Geometriae Dedicata 5 (1976), 525-528. MR 0485456 | Zbl 0349.05018

[5] Dvořaková, Ruličová I.: Perfect codes in regular graphs. Comment. Math. Univ. Carolinae 29 (1988), 79-83. MR 0937551

[6] Etienne G.: Perfect codes and regular partitions in graphs and groups. Europ. J. Combinatorics 8 (1987), 139-144. MR 0896126 | Zbl 0626.05051

[7] Kratochvíl J.: Perfect codes in general graphs. in Proceedings 7th Hungarian colloqium on Combinatorics, Eger 1987, Colloquia Math. Soc. J. Bolyai 52, pp.357-364. MR 1221574

[8] Kratochvíl J., Křivánek M.: On the computational complexity of codes in graphs. to appear in Proceedings MFCS'88, Karlovy Vary 1988, Lecture Notes in Comp. Sci. 324, Springer Verlag, Berlin 1988, pp. 396-404. MR 1023443

[9] Kratochvíl J., Malý J., Matoušek J.: On the existence of perfect codes m a random graph. to appear in Proceedings Random Graphs '87, Poznań 1987.

[10] Post K. A.: Nonexistence theorem on perfect Lee codes over large alphabets. Information and Control 29 (1975), 369-380. MR 0446719

[11] Seidel J. J.: Graphs and 2-graplis. 5-th Southeastern Confer. on Combin., Graphs, Computing, pp. 125-143, Utilitas Math. Publ. lnc. Winnipeg, 1974. MR 0364028

[12] Smith D. H.: Perfect codes in the graphs $O_k$ and $L(O_k)$. Glasgow Math. J. 21 (1980), 169-172. MR 0582126 | Zbl 0432.05048

[13] Tietäväinen A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24 (1973), 88-96. MR 0325260