Trellis complexity versus the coding gain of lattices. II

DOI10.1109/18.556676MaRDI QIDQ3129467zbMATH OpenOpenAlexFDO

Authors Vahid Tarokh, Ian Blake

Publication date 10 March 1998

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

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

zbMATH Keywords

coding gaincomplexitydecoding algorithmlatticesViterbi algorithm

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Decoding (94B35)

Recommendations

• Trellis complexity versus the coding gain of lattices. I
• The trellis complexity of convolutional codes
• On the trellis complexity of block and convolutional codes
• Upper bounds on trellis complexity of lattices
• Trellis complexity and pseudoredundancy of relative two-weight codes
• On the trellis complexity of certain binary linear block codes
• On complexity of trellis structure of linear block codes
• On bit-level trellis complexity of Reed-Muller codes
• Trellis Complexity of Short Linear Codes
• Trellis decoding complexity of linear block codes

Cited in

(5)

• Trellis complexity versus the coding gain of lattices. I
• The trellis complexity of convolutional codes
• On the trellis complexity of root lattices and their duals
• On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $
• Linear label code of a root lattice using Gröbner bases

This page was built for publication: Trellis complexity versus the coding gain of lattices. II

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