1. E. F. Assmus, Jr. and J. D. Key, “Polynomial codes and finite geometries,” in Handbook of Coding Theory, Vol. 1, Pt. 1, Algebraic Coding, V. S. Pless and W. Cary Huffman (eds.), Elsevier, Amsterdam (1998), pp. 1269-1343.
2. P. Charpin, “Les codes de Reed–Solomon en tant qu’ideáux d’une algèbre modulaire,” C. R. Acad. Sci. Paris., Sér. I, Math., 294, 597-600 (1982).
3. P. Charpin, “Une description des codes de Reed–Solomon dans une algèbre modulaire,” C. R. Acad. Sci. Paris., Sér. I, Math., 299, 779-782 (1984).
4. P. Landrock and O. Manz, “Classical codes as ideals in group algebras,” Des., Codes Crypt., 2, No. 3, 273-285 (1992).
5. E. Couselo, S. González, V. Markov, C. Martinez, and A. Nechaev, “Some constructions of linearly optimal group codes,” Lin. Alg. Appl., 433, No. 2, 356-364 (2010).