1. Rifà, J., Basart, J.M., and Huguet, L., On Completely Regular Propelinear Codes, Proc. 6th Int. Conf. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-6), Rome, Italy, July 4–8, 1988. Mora T., Ed., Lect. Notes Comp. Sci., vol. 357. Berlin: Springer, 1989, pp. 341–355.
2. Borges, J., Mogilnykh, I.Yu., Rifà, J., and Solov’eva, F.I., Structural Properties of Binary Propelinear Codes, Adv. Math. Commun., 2012, vol. 6, no. 3, pp. 329–346.
3. Mogil’nykh, I.Yu., On Extending Propelinear Structures of the Nordstrom-Robinson Code to the Hamming Code, Probl. Peredachi Inf., 2016, vol. 52, no. 3, pp. 97–107 [Probl. Inf. Trans. (Engl. Transl.), 2016, vol. 52, no. 3, pp. 289–298].
4. Hammons, A.R., Jr., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., and Solé, P., The Z4-Linearity of Kerdock, Preparata, Goethals, and Related Codes, IEEE Trans. Inform. Theory, 1994, vol. 40, no. 2, pp. 301–319.
5. Preparata, F.P., A Class of Optimum Nonlinear Double-Error-Correcting Codes, Inform. Control, 1968, vol. 13, no. 4, pp. 378–400.