Abstract
We consider a special class of idempotent of semisimple group algebras which we call essential. We give some criteria to decide when a primitive idempotent is essential; then we consider group algebras of cyclic group over finite fields, establish the number of essential idempotents in this case and find a relation among essential idempotents in different algebras. Finally we apply this ideas to coding theory and compute examples of codes with the best known weight.
Similar content being viewed by others
References
S. Assuena and C. Polcino Milies, Good Codes from Metacyclic Groups, Contemporary Math., 727 (2019), 39–47.
G. K. Bakshi, M. Raka, A. Sharma, Idempotents Generators of Irreducible Cyclic Codes, Proc. Int. Conf. Number Theory and Discrete Geometry, Ramanujan Lecture Notes, 6, (2008), 13–18, ed. R. Balasubramanian, S. G. Dani, P. M. Gruber, R. J. Hans-Gill.
S.D. Berman, On the theory of group codes, Kibernetika, 1, (1967) 31–39.
S.D. Berman, Semisimple cyclic and abelian codes, Kibernetika, 1, (1967) 17–23.
A. Bonisoli, Every equidistant linear code is a sequence of dual Hamming codes. Ars Combin. 18 (1984), 181-186.
R. Budaibes, Idempotentes primitivos em Algebras de Grupo Finitas e Codigos Minimais, PhD Thesis, Inst. de Matemática e Estatística, Univ. São Paulo, 2019.
Y. Cao, Y. Cao and F.W. Fu, Concatenated structure of left dihedral codes, Finite Fields Appl., 38 (2016), 93-115.
Y. Cao , Y. Cao, F.W. Fu, and J. Gao, On a Class of Left Metacyclic Codes, IEEE Trans. Inf. Theory, 62 (2016) 6786-6799.
G. Chalom, R. Ferraz and C. Polcino Milies, Essential idempotents and simplex codes, J. Algebra, Discrete Structures and Appl., 4, 2 (2017), 181-188.
G. Chalom, R. Ferraz and C. Polcino Milies, Essential idempotents and codes of constant weight, São Paulo J. of Math. Sci,, 11(2) (2018), 253-260.
M. Cornelissen and C. Polcino Milies, Finitely Generated Groups G such that \(G/{{\cal{Z}}}G \cong Cp \times Cp,\)Commun. Algebra, 42, 1 (2014), 378-388
F.S. Dutra, R. Ferraz and C. Polcino Milies, Semisimple Group Codes and Dihedral Codes, Algebra and Discrete Math., 3 (2009), 28–48.
R. Ferraz, M. Guerreiro and C. Polcino Milies, G-equivalence in group algebras and minimal Abelian codes, IEEE Trans. Information Theory, 60, 1, (2014), 252-260 .
R. Ferraz and C. Polcino Milies, Idempotents in group algebras and minimal Abelian codes, Finite Fields and Appl., , 13 (2007), 382-393.
C. García Pillado, S. Gonzalez, C. Martínez, V. Markov, and A. Nechaev, Group codes over non-abelian groups, J. Algebra Appl., 12, (2013).
E.G. Goodaire, E. Jespers and C. Polcino Milies, Alternative Loop Rings, North Holland Math. Studies N. 184, Elsevier, Amsterdam, 1996.
M. Grassl, Bounds on the minimum distance of linear codes and quantum codes. Available online at http://www.codetables.de.
M. Jensen, The concatenational structure of cyclic and abelian codes, IEEE Trans. Informormation Theory, 31 (1985), 788-793.
A.V. Keralev and P. Sole, Error-correcting codes as ideals in group rings, Contemporary Math., 273 (2001), 11-18.
P. Landrock and O. Manz, Classical codes as ideals in group rings. Designs, Codes and Criptpgraphy, 2 (1992), 273-285.
R. Lidl and H. Niederreiter, Finite Fields, Encycl. of Math. and its Appl, Vol. 20, Cambridge University Press, Cambridge, 1997.
F.J. MacWilliams, Binary codes which are ideals in the group algebra of an Abelian group, Bell System Tech. J., 49 (1970), 987-1011.
F. Melo and C. Polcino Milies, On cyclic and Abelian codes, IEEE Transactions on Information Theory, 59, 11 (2013), 7314-7319.
R.L. Miller, Minimal codes in Abelian group algebras, J. Combinatorial Theory, 26 (1979), 166-178.
Olteanu, G. ; Van Gelder, I. Construction of minimal non-Abelian left group codes, Des. Codes Cryptogr., 75 (2015),359-373.
C. Polcino Milies, Group algebras and coding theory: a short survey, Revista Integración, 37, 1 (2019), 153 - 166
C. Polcino Milies and S.K Sehgal, An introduction to Group Rings, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2002, 371 pp.
E. Prange, Cyclic error-correcting codes in two symbols, AFCRC-TN-57-103, USAF, Cambridge Research Laboratories, New York (1957)
R.E. Sabin, Minimum distance bounds for Abelian codes, in Applicable Algebra in Engeneering, Communications and Computing, Springer, New York, 1992.
R.E. Sabin and S.J. Lomonaco, Metacyclic error-correcting codes, Appl. Algebra Eng. Commun. Comput. 6 (1995), 191-210.
E. Taufer, Ideais em anéis de matrizes finitos e aplicações à Teoria de Códigos, PhD Thesis, Inst. de Matemática e Estatística, Univ. São Paulo, 2018.
O.Broche, A. Herman, A. Konovalov, A. Olivieri, G. Olteanu, Á. del Río, I. Van Gelder: Wedderga - Wedderburn Decomposition of Group Algebras. Version 4.6.0 (2013). http://www.cs.st-andrews.ac.uk/alexk/wedderga, http://www.gap-system.org/Packages/wedderga.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Gadadhar Misra.
Dedicated to Prof. I.B.S. Passi on the occasion of his 80th birthday.
Rights and permissions
About this article
Cite this article
Ferraz, R.A., Milies, C.P. Essential idempotents in group algebras and coding theory. Indian J Pure Appl Math 52, 747–760 (2021). https://doi.org/10.1007/s13226-021-00187-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-021-00187-5