Linear block codes over cyclic groups

DOI10.1109/18.412673MaRDI QIDQ4859751zbMATH OpenOpenAlexFDO

Authors Ezio Biglieri, Giuseppe Caire

Publication date 3 June 1996

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

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

zbMATH Keywords

boundblock codesminimum Euclidean distancecoded modulation schemestrellis constructiongeometrically uniformed code

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Linear codes (general theory) (94B05) Other types of codes (94B60) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Geometrically uniform TCM codes over groups based on L×MPSK constellations
• Geometrically uniform codes
• How to Know if a Linear Code Is a Group Code?
• Geometrically uniform hyperbolic codes
• Multilevel construction of block and trellis group codes

Cited in

(7)

• Flat tori, lattices and bounds for commutative group codes
• On duals and parity-checks of convolutional codes over \(\mathbb{Z}_{p^r}\)
• scientific article; zbMATH DE number 2109513 (Why is no real title available?)
• Optimum commutative group codes
• Modular and \(p\)-adic cyclic codes
• Geometrically uniform hyperbolic codes
• Geometrically uniform codes

This page was built for publication: Linear block codes over cyclic groups

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