Minimum distance and decoding of Coxeter codes

Abstract

A binary Coxeter code associated with a finite Coxeter system $(W,S)$ is an ${\mathbb{F}}_2$-linear span of indicators of standard cosets of a fixed rank. Coxeter codes, introduced in a recent paper by N. Coble and A. Barg, are a generalization of Reed--Muller codes which arise when $W={\mathbb{Z}}_2^m$ is the Coxeter group of type $m{A}_1$. In that paper, the authors proposed a conjectural value for the minimum distance of a general Coxeter code. This conjecture is proved in the present work. As a consequence, we obtain a Coxeter-theoretic generalization of Reed's majority-logic decoding algorithm for Reed--Muller codes.

16 pages