Some algebraic questions about the Reed-Muller code

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)

Abstract: Let

R_{q} (r, n)

denote the

r

th order Reed-Muller code of length

q^{n}

over

B b b 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 $e x t G L (n, B b b F_{2})$ on $H_{2} (r, n)$ and on $H_{2} (r^{'}, n)$ , where $r + r^{'} = 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 < e x t c h a r, B b b F_{q}$ . (2) Let $m a t h c a l F (B b b F_{q}^{n}, B b b F_{q})$ denote the $B b b F_{q}$ -algebra of all functions from $B b b F_{q}^{n}$ to $B b b F_{q}$ . It is known that when $q$ is a prime, the Reed-Muller codes $0 = R_{q} (- 1, n) s u b s e t R_{q} (0, n) s u b s e t c d o t s s u b s e t R_{q} (n (q - 1), n) = m a t h c a l F (B b b F_{q}^{n}, B b b F_{q})$ are the only $e x t A G L (n, B b b F_{q})$ -submodules of $m a t h c a l F (B b b F_{q}^{n}, B b b F_{q})$ . In particular, $H_{q} (r, n)$ is an irreducible $e x t G L (n, B b b 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 $e x t G L (n, B b b F_{q})$ over $B b b F_{q}$ .

Recommendations

Cites work

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)