首页|Codes from A_m-invariant polynomials

Codes from A_m-invariant polynomials

扫码查看
Let q be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on F_q [x_1,…, x_m] combined with the ideas in Datta and Johnsen (Des Codes Cryptogr 91(3):747-761, 2023). Compared with Generalized Reed-Muller codes with analogous parameters, our codes have the same asymptotic relative distance but a better rate. Our results follow from combinations of Galois theoretical methods with Weil-type bounds for hypersurfaces.

Reed-Muller codesAlternating groupPermutations

Giacomo Micheli、Vincenzo Pallozzi Lavorante、Phillip Waitkevich

展开 >

University of South Florida, 4202 E Fowler Ave, Tampa 33620, USA

2025

Designs, codes and cryptography

Designs, codes and cryptography

ISSN:0925-1022
年,卷(期):2025.93(6)