Affine Reflection Group Codes

This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irreducible affine reflection groups of rank n 2, for varying stabilizer subgroups. Moreover, we use a detailed analysis of the geometry of affine reflection groups to produce an efficient decoding algorithm which is equivalent to the maximum-likelihood decoder. Its complexity depends only on the dimension of the vector space containing the codewords, and not on the number of codewords. We give several examples of the decoding algorithm, both to demonstrate its correctness and to show how, in small rank cases, it may be further streamlined by exploiting additional symmetries of the group. 1

• Type: Journal
• Year: 2008
• Where: TIT
• Authors: Terasan Niyomsataya, Ali Miri, Monica Nevins
• Keywords: Affine Reflection Groups, Decoding Algorithm, Irreducible Affine Reflection, TIT 2008