Cyclic sieving for cyclic codes

DOI10.1016/J.FFA.2021.101846MaRDI QIDQ2031648zbMATH OpenOpenAlexFDO

Authors Alex Mason, Victor Reiner, Shruthi Sridhar

Publication date 10 June 2021

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2004.11998

zbMATH Keywords

cyclic codescyclic sievingdescent numberinversion numberMahonian statisticsmajor indexpolynomials

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18) Cyclic codes (94B15)

Abstract: Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain cyclic codes. For example, it is shown that, among dual Hamming codes over $F_q$, the generating function for codedwords according to the major index statistic (resp. the inversion statistic) gives rise to a CSP when $q=2$ or $q=3$ (resp. when $q=2$). A byproduct is a curious characterization of the irreducible polynomials in $F_2[x]$ and $F_3[x]$ that are primitive.

Recommendations

• The cyclic sieving phenomenon
• scientific article; zbMATH DE number 6938009
• The cone of cyclic sieving phenomena
• The cyclic sieving phenomenon: a survey
• Refined Catalan and Narayana cyclic sieving

Cites work

• Constructions for Cyclic Sieving Phenomena
• scientific article; zbMATH DE number 1209696 (Why is no real title available?)
• Refined cyclic sieving on words for the major index statistic
• Stream Ciphers
• The cyclic sieving phenomenon
• The mathematics of coding theory. Information, compression, error correction and finite fields.

Cited in

(1)

• scientific article; zbMATH DE number 5572824 (Why is no real title available?)

This page was built for publication: Cyclic sieving for cyclic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031648)