Group codes generated by finite reflection groups

DOI10.1109/18.485721MaRDI QIDQ4885682zbMATH OpenOpenAlexFDO

Authors Thomas Mittelholzer, Jyrki Lahtonen

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

minimum distancecardinalitydecoding algorithmgroup codesfinite Coxeter groupsmaximum-likelihood decodingpermutation modulationinitial-point problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 820503
• Affine Reflection Group Codes
• Decoding affine reflection group codes with trellises
• Representing group codes as permutation codes

Cited in

(9)

• Applications of representation theory to wireless communications
• Decoding affine reflection group codes with trellises
• On the non-abelian group code capacity of memoryless channels
• Representing group codes as permutation codes
• scientific article; zbMATH DE number 820503 (Why is no real title available?)
• Affine Reflection Group Codes
• Reflection Group Codes and Their Decoding
• 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

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