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

DOI10.1137/S0895480195283348zbMATH Open0868.94048MaRDI QIDQ4717569FDOQ4717569

Authors: Vahid Tarokh, Ian Blake 

Publication date: 1 December 1996

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

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

zbMATH Keywords

trellis complexitylattice packings

Mathematics Subject Classification ID

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

Cited In (4)

• Optimum commutative group codes
• Title not available (Why is that?)
• On the trellis complexity of root lattices and their duals
• The densest lattices in \(\mathrm{PGL}_3(\mathbb Q_2)\)

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)