Upper bounds on trellis complexity of lattices

DOI10.1109/18.605598zbMath0883.94009OpenAlexW2154957021MaRDI QIDQ4345634

Vahid Tarokh, Alexander Vardy

Publication date: 5 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.605598

zbMATH Keywords

Euclidean latticescomplexity of latticestrellis diagrams

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Lattice packing and covering (number-theoretic aspects) (11H31)

Related Items (1)

Scalable revocable identity-based signature over lattices in the standard model

This page was built for publication: Upper bounds on trellis complexity of lattices