Abstract
In this paper, we investigate some properties of ideals in group algebras of finite groups over fields. First, we highlight an important link between their dimension, their minimal Hamming distance and the group order. This is a generalized version of an uncertainty principle shown in 1992 by Meshulam. Secondly, we introduce the notion of the Schur product of ideals in group algebras and investigate the module structure and the dimension of the Schur square. We give a structural result on ideals that coincide with their Schur square, and we provide conditions for an ideal to be such that its Schur square has the projective cover of the trivial module as a direct summand. This has particularly interesting consequences for group algebras of 𝑝-groups over fields of characteristic 𝑝.
Funding source: Agence Nationale de la Recherche
Award Identifier / Grant number: ANR-21-CE39-0009
Funding statement: The first author was partially supported by the ANR-21-CE39-0009 – BARRACUDA (French Agence Nationale de la Recherche). The third author was partially supported by the Italian National Group for Algebraic and Geometric Structures and their Applications (GNSAGA – INdAM).
-
Communicated by: Manfred Droste
References
[1] F. Alizadeh, S. P. Glasby and C. E. Praeger, Sequences of linear codes where the rate times distance grows rapidly, preprint (2021), https://arxiv.org/abs/2110.01277. Search in Google Scholar
[2] L. M. J. Bazzi and S. K. Mitter, Some randomized code constructions from group actions, IEEE Trans. Inform. Theory 52 (2006), no. 7, 3210–3219. 10.1109/TIT.2006.876244Search in Google Scholar
[3] S. D. Berman, On the theory of group codes, Cybernetics 3 (1969), no. 1, 25–31. 10.1007/BF01072842Search in Google Scholar
[4] J. J. Bernal, Á. del Río and J. J. Simón, An intrinsical description of group codes, Des. Codes Cryptogr. 51 (2009), no. 3, 289–300. 10.1007/s10623-008-9261-zSearch in Google Scholar
[5] F. Bernhardt, P. Landrock and O. Manz, The extended golay codes considered as ideals, J. Combin. Theory Ser. A 55 (1990), no. 2, 235–246. 10.1016/0097-3165(90)90069-9Search in Google Scholar
[6] M. Borello, J. De La Cruz and W. Willems, On checkable codes in group algebras, J. Algebra Appl. 2021 (2021), Article ID 2250125. 10.1142/S0219498822501250Search in Google Scholar
[7] M. Borello and P. Solé, The uncertainty principle over finite fields, Discrete Math. 345 (2022), Paper No. 112670. 10.1016/j.disc.2021.112670Search in Google Scholar
[8] M. Borello and W. Willems, Group codes over fields are asymptotically good, Finite Fields Appl. 68 (2020), no. 12, Paper No. 101738. 10.1016/j.ffa.2020.101738Search in Google Scholar
[9] M. Borello and W. Willems, On the algebraic structure of quasi group codes, J. Algebra Appl., to appear. 10.1142/S0219498823502225Search in Google Scholar
[10] A. Couvreur, P. Gaborit, V. Gauthier-Umaña, A. Otmani and J.-P. Tillich, Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes, Des. Codes Cryptogr. 73 (2014), no. 2, 641–666. 10.1007/s10623-014-9967-zSearch in Google Scholar
[11] S. Evra, E. Kowalski and A. Lubotzky, Good Cyclic Codes and the Uncertainty Principle, Enseign. Math. 63 (2017), no. 3–4, 305–332. 10.4171/LEM/63-3/4-4Search in Google Scholar
[12] T. Feng, H. D. L. Hollmann and Q. Xiang, The shift bound for abelian codes and generalizations of the Donoho–Stark uncertainty principle, IEEE Trans. Inform. Theory 65 (2019), no. 8, 4673–4682. 10.1109/TIT.2019.2906301Search in Google Scholar
[13] G. B. Folland and A. Sitaram, The uncertainty principle: A mathematical survey, J. Fourier Anal. Appl. 3 (1997), no. 3, 207–238. 10.1007/BF02649110Search in Google Scholar
[14] E. J. García-Claro and H. Tapia-Recillas, On the dimension of ideals in group algebras, and group codes, J. Algebra Appl. 21 (2022), no. 2, Paper No. 2250024. 10.1142/S0219498822500244Search in Google Scholar
[15] W. C. Huffman, J.-L. Kim and P. Solé, Concise Encyclopedia of Coding Theory, Chapman and Hall/CRC, Boca Raton, 2021. 10.1201/9781315147901Search in Google Scholar
[16] B. Huppert and N. Blackburn, Finite Groups. II, Grundlehren Math. Wiss. 242, Springerg, Berlin, 1982. 10.1007/978-3-642-67994-0Search in Google Scholar
[17] J. MacWilliams, Codes and ideals in group algebras, Combinatorial Mathematics and its Applications, University of North Carolina, Chapel Hill (1969), 317–328. Search in Google Scholar
[18] R. Meshulam, An uncertainty inequality for groups of order pq, European J. Combin. 13 (1992), no. 5, 401–407. 10.1016/S0195-6698(05)80019-8Search in Google Scholar
[19] R. Pellikaan and I. Márquez-Corbella, Error-correcting pairs for a public-key cryptosystem, J. Phys. Conf. Ser. 855 (2017), Article ID 012032. 10.1088/1742-6596/855/1/012032Search in Google Scholar
[20] H. Randriambololona, On products and powers of linear codes under componentwise multiplication, Algorithmic Arithmetic, Geometry, and Coding Theory, Contemp. Math. 637, American Mathematical Society, Providence (2015), 3–78. 10.1090/conm/637/12749Search in Google Scholar
[21] J. Schur, Bemerkungen zur Theorie der beschränkten Bilinearformen mit unendlich vielen Veränderlichen, J. Reine Angew. Math. 140 (1911), 1–28. 10.1007/978-3-642-61947-2_19Search in Google Scholar
[22] J.-P. Serre, Linear Representations of Finite Groups, Grad. Texts in Math. 42, Springer, New York, 1977. 10.1007/978-1-4684-9458-7Search in Google Scholar
[23] T. Tao, An uncertainty principle for cyclic groups of prime order, Math. Res. Lett. 12 (2005), no. 1, 121–128. 10.4310/MRL.2005.v12.n1.a11Search in Google Scholar
[24] C. Wieschebrink, Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes, Post-Quantum Cryptography, Lecture Notes in Comput. Sci. 6061, Springer, Berlin (2010), 61–72. 10.1007/978-3-642-12929-2_5Search in Google Scholar
© 2022 Walter de Gruyter GmbH, Berlin/Boston
