Abstract
It has been known some time ago that there are one-sided group codes that are not abelian codes, however the similar question for group codes was not known until we constructed an example of a non-abelian group code using the group ring \(F_{5}S_{4}\). The proof needs some computational help, since we need to know the weight distribution of all abelian codes of length 24 over the prime field of 5 elements. It is natural to ask, is it really relevant that the group ring is semisimple? What happens in the case of characteristic 2 and 3? Our interest to these questions is connected also with the following open question: does the property of all group codes for the given group to be abelian depend on the choice of the base field (the similar property for left group codes does)? We have addressed this question, again with computer help, proving that there are also examples of non-abelian group codes in the non-semisimple case. The results show some interesting differences between the cases of characteristic 2 and 3. Moreover, using the group SL(2, F 3) instead of the symmetric group we can prove, without using a computer for it, that there is a code over F 2 of length 24, dimension 6 and minimal weight 10. It has greater minimum distance than any abelian group code having the same length and dimension over F 2, and moreover this code has the greatest minimum distance among all binary linear codes with the same length and dimension. The existence of such code gives a good reason to study non-abelian group codes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bernal, J., del Río, A., Simón, J.: An intrinsical description of group codes. Des. Codes Cryptogr. 51(3), 289–300 (2009)
Couselo, E., González, S., Markov, V., Nechaev, A.: Loop codes. Discret. Math. Appl. 14(2), 163–172 (2004)
Curtis, R., Reiner, I.: Representation Theory of Finite Groups and Associative Algebras. Wiley, New York (1962)
García Pillado, C., González, S., Martínez, C., Markov, V., Nechaev, A.: Group codes which are not abelian group codes. In: 3rd International Castle Meeting on Coding Theory and Applications, Cardona, pp. 123–127. Universitat Autònoma de Barcelona, Servei de Publicacions (2011)
García Pillado, C., González, S., Martínez, C., Markov, V., Nechaev, A.: When are all group codes of a noncommutative group abelian (a computational approach)? J. Math. Sci. 186(5), 578–585 (2012)
García Pillado, C., González, S., Martínez, C., Markov, V., Nechaev, A.: Group codes over non-abelian groups. J. Algebra Appl. 12(7) (2013). doi:10.1142/S0219498813500370
Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http://www.codetables.de (2007). Accessed on 29 April 2014
Acknowledgements
This work was partially supported by project MTM2010-18370-C04-01* and by RFBR grant 11-01-00794-a.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pillado, C.G., González, S., Markov, V., Martínez, C., Nechaev, A. (2015). New Examples of Non-Abelian Group Codes. In: Pinto, R., Rocha Malonek, P., Vettori, P. (eds) Coding Theory and Applications. CIM Series in Mathematical Sciences, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-319-17296-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-17296-5_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17295-8
Online ISBN: 978-3-319-17296-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)