Symmetries of weight enumerators and applications to Reed-Muller codes (Q2415395): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128350729, #quickstatements; #temporary_batch_1724848174377 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963361860 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1707.00575 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Zeroes of Polynomials Over Finite Fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetries of polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of formally self-dual even codes of lengths up to 16 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On automorphism groups of binary linear codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Magma algebra system. I: The user language / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773715 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weight distributions of linear codes and the Gleason-Pierce theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An upper bound for self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-dual codes and invariant theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4242010 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Is there a (72,36) d = 16 self-dual code? (Corresp.) / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128350729 / rank | |||
Normal rank |
Latest revision as of 14:36, 28 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Symmetries of weight enumerators and applications to Reed-Muller codes |
scientific article |
Statements
Symmetries of weight enumerators and applications to Reed-Muller codes (English)
0 references
21 May 2019
0 references
The paper deals with a generalization of Gleason's theorem for the weight enumerators of self-dual codes. The authors seek to determine what the possible groups of symmetries of a weight enumerator are and how to compute them efficiently. If these have been computed, then they seek to prove they are symmetries of other weight enumerators for a family of codes and to determine new properties or unknown weight enumerators. Firstly, they prove that if $V(p(x,y))$ is the set of roots of the polynomial in the projective line $\mathbb{P}(\mathbb{C})$, then the group of symmetries of the weight enumerator $p(x,y)$ of a code is finite if and only if $\# V(p(x,y)) \geq 3$. They list the possible groups of symmetries and develop a new algorithm for computing the group of symmetries of a given weight enumerator. Finally, they apply these techniques to Reed-Muller codes and produce an analogue of Gleason's theorem for all parameters in the binary case.
0 references
linear codes
0 references
weight enumerators
0 references
invariant theory
0 references
formally self-dual codes
0 references
Reed-Muller codes
0 references