Group Coding With Complex Isometries

DOI10.1109/TIT.2014.2365020MaRDI QIDQ2978801zbMATH OpenOpenAlexFDO

Authors Hye Jung Kim, J. B. Nation, Anne V. Shepler

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using geometric notions of minimal length coset representatives. The infinite family of complex reflection groups G(r,1,n) produces effective codes of arbitrarily large size that can be decoded in relatively few steps.

Cited in

(4)

• Coding of the dimension group
• Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups
• Resistance diameters and critical probabilities of Cayley graphs on irreducible complex reflection groups
• On the non-abelian group code capacity of memoryless channels

This page was built for publication: Group Coding With Complex Isometries

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