1. A. E. Brouwer, “Bounds on linear codes,” in: V. S. Pless and W. C. Huffman, eds., Handbook of Coding Theory, Elsevier, Amsterdam (1998), pp. 295–461.
2. S. Gonzalez, E. Kouselo, V. Markov, and A. Nechaev, “Group codes and their nonassociative generalizations,” Diskret. Mat., 14, No. 1, 146–156 (2004).
3. M. Grassl, “Searching for linear codes with large minimum distance,” in: W. Bosma and J. Cannon, eds., Discovering Mathematics with Magma, Springer, Berlin (2006).
4. A. V. Gribov, P. A. Zolotykh, and A. V. Mikhalev, “Building algebraic cryptosystem over a quasigroup ring,” Math. Probl. Crypt., 1, No. 4, 23–33 (2010).
5. A. V. Gribov, “The homomorphism of some cryptographic systems on the basis of nonassociative structures,” Fundam. Prikl. Mat., 20, No. 1, 135–149 (2015).