1. Goppa, V.D., A New Class of Linear Correcting Codes, Probl. Peredachi Inf., 1970, vol. 6, no. 3, pp. 24–30 [Probl. Inf. Trans. (Engl. Transl.), 1970, vol. 6, no. 3, pp. 207–212].
2. Loeloeian, M. and Conan, J., A (55, 16, 19) Binary Goppa Code, IEEE Trans. Inform. Theory. 1984, vol. 30, no. 5, pp. 773.
3. Bezzateev, S.V. and Shekhunova, N.A., On the Designed Distance of the Best Known (55, 16, 19) Goppa Code, Probl. Peredachi Inf., 1987, vol. 23, no. 4, p. 119 [Probl. Inf. Trans. (Engl. Transl.), 1987, vol. 23, no. 4, p. 352].
4. Shekhunova, N.A., Bezzateev, S.V., and Mironchikov, E.T., A Subclass of Binary Goppa Codes, Probl. Peredachi Inf., 1989, vol. 25, no. 3, pp. 98–102 [Probl. Inf. Trans. (Engl. Transl.), 1989, vol. 25, no. 3, pp. 247–250].
5. Bezzateev, S.V. and Shekhunova, N.A., A Subclass of Binary Goppa Codes with Improved Estimation of the Code Dimension, Des. Codes Cryptogr., 1998, vol. 14, no. 1, pp. 23–38.