1. Nordstrom, A.W. and Robinson, J.P., An Optimum Nonlinear Code, Inform. Control, 1967, vol. 11, no. 5–6, pp. 613–616. https://doi.org/10.1016/S0019-9958(67)90835-2
2. Semakov, N.V. and Zinoviev, V.A., Complete and Quasi-complete Balanced Codes, Probl. Peredachi Inf., 1969, vol. 5, no. 2, pp. 14–18 [Probl. Inf. Transm. (Engl. Transl.), 1969, vol. 5, no. 2, pp. 11–13]. http://mi.mathnet.ru/eng/ppi1794
3. Golay, M.J.E., Notes on Digital Coding, Proc. IRE, 1949, vol. 37, p. 657. https://doi.org/10.1109/JRPROC.1949.233620
4. 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.
5. Snover, S.L., The Uniqueness of the Nordstrom-Robinson and the Golay Binary Codes, PhD Thesis, Dept. Math., Michigan State Univ., 1973. https://doi.org/10.25335/M56D5PM3R