Trellis complexity versus the coding gain of lattices. I

DOI10.1109/18.556675zbMath0882.94028OpenAlexW2109846088MaRDI QIDQ3129466

Vahid Tarokh, Ian F. 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.556675

zbMATH Keywords

complexitycoding gainlatticesViterbi algorithmdecoding algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Scalable revocable identity-based signature over lattices in the standard model ⋮ 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. I