Group codes generated by finite reflection groups

DOI10.1109/18.485721zbMATH Open0856.94026OpenAlexW2120316028MaRDI QIDQ4885682FDOQ4885682

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

Recommendations

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

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)

Cited In (8)

• A heuristic approach for designing cyclic group codes
• Applications of representation theory to wireless communications
• Reflection Group Codes and Their Decoding
• Optimum commutative group codes
• Affine Reflection Group Codes
• Title not available (Why is that?)
• On the non-abelian group code capacity of memoryless channels
• Representing group codes as permutation 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)