A geometric construction procedure for geometrically uniform trellis codes

DOI10.1109/18.532890MaRDI QIDQ4896828zbMATH OpenOpenAlexFDO

Authors Y. Levy, Daniel J. jun. Costello

Publication date 22 October 1996

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

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

zbMATH Keywords

convolutional codesEuclidean distancetrellis code

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Geometrically uniform partitions of L*MPSK constellations and related binary trellis codes
• New trellis codes based on lattices and cosets
• Geometrically uniform TCM codes over groups based on L×MPSK constellations
• A systematic approach to the construction of bandwidth-efficient multidimensional trellis codes

Cited in

(4)

• Geometrical Uniformity of a Class of Space–Time Trellis Codes
• Geometrically uniform TCM codes over groups based on L×MPSK constellations
• Geometrically uniform partitions of L*MPSK constellations and related binary trellis codes
• scientific article; zbMATH DE number 820516 (Why is no real title available?)

This page was built for publication: A geometric construction procedure for geometrically uniform trellis codes

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