Some algebraic questions about the Reed-Muller code

DOI10.1016/J.JALGEBRA.2024.01.044arXiv2209.00169MaRDI QIDQ6203799FDOQ6203799

Xiang-Dong Hou

Publication date: 8 April 2024

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: Let $R_q(r,n)$ denote the $r$th order Reed-Muller code of length $q^n$ over $Bbb{F}_q$. We consider two algebraic questions about the Reed-Muller code. Let $H_q(r,n)=R_q(r,n)/R_q(r-1,n)$. (1) When $q=2$, it is known that there is a ``duality between the actions of $extGL(n,Bbb{F}_2)$ on $H_2(r,n)$ and on $H_2(r^{\prime },n)$, where $r+r^{\prime }=n$. The result is false for a general $q$. However, we find that a slightly modified duality statement still holds when $q$ is a prime or $r<extchar,Bbb{F}_q$. (2) Let $mathcalF(Bbb{F}_q^n,Bbb{F}_q)$ denote the $Bbb{F}_q$-algebra of all functions from $Bbb{F}_q^n$ to $Bbb{F}_q$. It is known that when $q$ is a prime, the Reed-Muller codes $0=R_q(-1,n)subset{R}_q(0,n)subsetcdotssubset{R}_q(n(q-1),n)=mathcalF(Bbb{F}_q^n,Bbb{F}_q)$ are the only $extAGL(n,Bbb{F}_q)$-submodules of $mathcalF(Bbb{F}_q^n,Bbb{F}_q)$. In particular, $H_q(r,n)$ is an irreducible $extGL(n,Bbb{F}_q)$-module when $q$ is a prime. For a general $q$, $H_q(r,n)$ is not necessarily irreducible. We determine all its submodules and the factors in its composition series. The factors of the composition series of $H_q(r,n)$ provide an explicit family of irreducible representations of $extGL(n,Bbb{F}_q)$ over $Bbb{F}_q$.

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

zbMATH Keywords

finite fieldgeneral linear groupReed-Muller codecomposition seriesmodular representationaffine linear group

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Modular representations and characters (20C20) Representations of finite groups of Lie type (20C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the modular representations of the general linear and symmetric groups
• Permutation Decoding of Systematic Codes
• Polynomial representations of \(GL_n\)
• Irreducible modular representations of GL\(_ 2\) of a local field
• Some results on cyclic codes which are invariant under the affine group and their applications
• The permutation group of affine-invariant extended cyclic codes
• Reed-Muller codes and permutation decoding
• The automorphism group of Generalized Reed-Muller codes
• The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
• Title not available (Why is that?)
• Improved partial permutation decoding for Reed-Muller codes
• Enumeration of AGL\((\frac{m}{3}, \mathbb F_{p^3})\)-invariant extended cyclic codes
• On self-dual affine-invariant codes
• Enumeration of certain affine invariant extended cyclic codes
• On cyclic codes that are invariant under the general linear group
• On the Number of Irreducible Modular Representations of a Finite Group
• Title not available (Why is that?)
• \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
• Title not available (Why is that?)
• Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
• The Covering Radius of the Reed–Muller Code RM(m – 4, m) in RM(m – 3, m)

This page was built for publication: Some algebraic questions about the Reed-Muller code

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