By Topic

Density/length profiles and trellis complexity of lattices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
G. D. Forney ; Motorola Inc., Mansfield, MA, USA

The density/length profile (DCP) of a lattice Λ is analogous to the dimension/length profile of a linear code. The DLP is a geometrical invariant of Λ that includes the coding gain of Λ. Duality results analogous to those of linear block codes are derived for lattices. Bounds on the DLP may be derived from bounds on Hermite's constants; these hold with equality for many dense lattices. In turn, the DLP lowerbounds the state complexity profile of a minimal trellis diagram for Λ in any coordinate system. It is shown that this bound can be met for the E8 lattice by a laminated lattice construction with a novel trellis diagram. Bounds and constructions for other important low-dimensional lattices are given. Two laminated lattice constructions of the Leech lattice yield trellis diagrams with maximum state space sizes 1024 and 972

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 6 )