1. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.
2. Liu, C.L., Ong, B.G., and Ruth, G.R., A Construction Scheme for Linear and Non-linear Codes, Discrete Math., 1973, vol. 4, no. 2, pp. 171–184. https://doi.org/10.1016/0012-365X(73)90080-0
3. Pulatov, A.K., A Lower Bound for the Complexity of Scheme Realization for a Certain Class of Codes, in Diskretnyi analiz (Discrete Analysis), Novosibirsk: Inst. Mat. Sib. Otd. Akad. Nauk SSSR, 1974, vol. 25, pp. 56–61.
4. 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.
5. Solov’eva, F.I., On ℤ4-Linear Codes with Parameters of Reed-Muller Codes, Probl. Peredachi Inf., 2007, vol. 43, no. 1, pp. 32–38 [Probl. Inf. Transm. (Engl. Transl.), 2007, vol. 43, no. 1, pp. 26–32]. http://mi.mathnet.ru/eng/ppi4