Group codes generated by finite reflection groups

DOI10.1109/18.485721zbMath0856.94026OpenAlexW2120316028MaRDI QIDQ4885682

Jyrki Lahtonen, Thomas Mittelholzer

Publication date: 26 February 1997

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

Full work available at URL: https://doi.org/10.1109/18.485721

zbMATH Keywords

group codesfinite Coxeter groupscardinalityminimum distancedecoding algorithmmaximum-likelihood decodingpermutation modulationinitial-point problem

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other geometric groups, including crystallographic groups (20H15) Combinatorial codes (94B25) Decoding (94B35)

Related Items (4)

Applications of representation theory to wireless communications ⋮ On the non-abelian group code capacity of memoryless channels ⋮ Optimum commutative group codes ⋮ A heuristic approach for designing cyclic group codes

This page was built for publication: Group codes generated by finite reflection groups