SYMMETRIES OF WEIGHT ENUMERATORS AND APPLICATIONS TO REED-MULLER CODES - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Advances in Mathematics of Communications Année : 2019

SYMMETRIES OF WEIGHT ENUMERATORS AND APPLICATIONS TO REED-MULLER CODES

Résumé

Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on the symmetries given by MacWilliams' identities. This paper is intended to be a first step towards a more general investigation of symmetries of weight enumerators. We list the possible groups of symmetries, dealing both with the finite and infinite case, we develop a new algorithm to compute the group of symmetries of a given weight enumerator and apply these methods to the family of Reed-Muller codes, giving, in the binary case, an analogue of Gleason's theorem for all parameters.
Fichier principal
Vignette du fichier
1707.00575.pdf (226.24 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03852296 , version 1 (14-11-2022)

Identifiants

Citer

Martino Borello, Olivier Mila. SYMMETRIES OF WEIGHT ENUMERATORS AND APPLICATIONS TO REED-MULLER CODES. Advances in Mathematics of Communications, 2019, 13 (2), pp.313-328. ⟨10.3934/amc.2019021⟩. ⟨hal-03852296⟩
16 Consultations
96 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More