1. Yekhanin, S. and Dumer, I., Long Nonbinary Codes Exceeding the Gilbert-Varshamov Bound for any Fixed Distance, IEEE Trans. Inform. Theory, 2004, vol. 50, no.10, pp. 2357–2362.
2. Kabatyanskii, G.A. and Panchenko, V.I., Unit Sphere Packings and Coverings of the Hamming Space, Probl. Peredachi Inf., 1988, vol. 24, no.4, pp. 3–16 [Probl. Inf. Trans. (Engl. Transl.), 1988, vol. 24, no. 4, pp. 261–272].
3. Berlekamp, E.R., Block Coding with Noiseless Feedback, PhD Thesis, MIT, Cambridge, 1964 (see also Berlekamp, E.R., Block Coding for the Binary Symmetric Channel with Noiseless, Delayless Feedback, Error-Correcting Codes, Mann, H.B., Ed., New York: Wiley, 1969, pp. 61–85 [Russian Transl. in Kibern. Sb. Nov. Ser., vol. 9, Moscow: Mir, 1972, pp. 5–29]).
4. Zingangirov, K.Sh., On the Number of Correctable Errors for Transmission over a Binary Symmetrical Channel with Feedback, Probl. Peredachi Inf., 1976, vol. 12, no.2, pp. 3–19 [Probl. Inf. Trans. (Engl. Transl.), 1976, vol. 12, no. 2, pp. 85–97].
5. Zinoviev, V.A. and Katsman, G.L., Universal Code Families, Probl. Peredachi Inf., 1993, vol. 29, no.2, pp. 3–8 [Probl. Inf. Trans. (Engl. Transl.), 1993, vol. 29, no. 2, pp. 95–100].