On the Trellis Complexity of the Densest Lattice Packings in \mathbb{R}^n

DOI10.1137/S0895480195283348MaRDI QIDQ4717569zbMATH OpenFDO

Authors Vahid Tarokh, Ian Blake

Publication date 1 December 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480195283348

zbMATH Keywords

lattice packingstrellis complexity

Mathematics Subject Classification ID

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

Recommendations

• Upper bounds on trellis complexity of lattices
• On the trellis complexity of root lattices and their duals
• Trellis complexity versus the coding gain of lattices. II

Cited in

(5)

• An inequality on the coding gain of densest lattice packings in successive dimensions
• Optimum commutative group codes
• scientific article; zbMATH DE number 4106925 (Why is no real title available?)
• The densest lattices in \(\mathrm{PGL}_3(\mathbb Q_2)\)
• On the trellis complexity of root lattices and their duals

This page was built for publication: On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $

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