By Topic

New trellis codes based on lattices and cosets

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

2 Author(s)

A new technique is proposed for constructing trellis codes. which provides an alternative to Ungerboeck's method of "set partitioning." The new codes use a signal constellation consisting of points from an n -dimensional lattice \Lambda , with an equal number of points from each coset of a sublattice \Lambda ' . One part of the input stream drives a generalized convolutional code whose outputs are cosets of \Lambda ' , while the other part selects points from these cosets. Several of the new codes are better than those previously known.

Published in:

IEEE Transactions on Information Theory  (Volume:33 ,  Issue: 2 )