1. Avgustinovich, S.V. and Solov’eva, F.I., Construction of Perfect Binary Codes by Sequential Shifts of ᾶ-Components, Probl. Peredachi Inf., 1997, vol. 33, no. 3, pp. 15–21 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 3, pp. 202–207].
2. Solov’eva, F.I., On Binary Nongroup Codes, in Metody diskretnogo analiza v izuchenii bulevykh funktsii i grafov (Methods of Discrete Analysis in Studying Boolean Functions and Graphs), Novosibirsk: Inst. Mat. Sib. Otd. Akad. Nauk SSSR, 1981, vol. 37, pp. 65–76.
3. Rifà, J. and Vardy, A., On Partitions of Space into Perfect Codes, i Proc. 3rd Mediterranean Workshop on Coding and Information Integrity, Ein Boqeq, Israel, 1997.
4. Borges, J., Fernández, C., Rifà, J., and Villanueva, M., Constructions of 1-Perfect Partitions on the n-Cube (Z/2)n, Tech. Report PIRDI 1/01, Escola Tècnica Superior d’Enginyeries (ETSE), Spain, 2001.
5. Rifà, J., Well-ordered Steiner Triple Systems and 1-Perfect Partitons of the n-Cube, SIAM J. Discrete Math., 1999, vol. 12, no. 1, P. 35–47.