1. Semakov, N.V. and Zinoviev, V.A., Equidistant q-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs, Probl. Peredachi Inf., 1968, vol. 4, no. 2, pp. 3–10 [Probl. Inf. Trans. (Engl. Transl.), 1968, vol. 4, no. 2, pp. 1–7].
2. Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., A Class of Maximum Equidistant Codes, Probl. Peredachi Inf., 1969, vol. 5, no. 2, pp. 84–87 [Probl. Inf. Trans. (Engl. Transl.), 1969, vol. 5, no. 2, pp. 65–68].
3. van Lint, J.H., A Theorem on Equidistant Codes, Discrete Math., 1973, vol. 6, pp. 353–358.
4. Hall, J.I., Bounds for Equidistant Codes and Partial Projective Planes, Discrete Math., 1977, vol. 17, no. 1, pp. 85–94.
5. Hall, J.I., Jansen, A.J.E.M., Kolen, A.W.J., and van Lint, J.H., Equidistant Codes with Distance 12, Discrete Math., 1977, vol. 17, no. 1, pp. 71–83.