New Trellis Codes Based on Lattices and Cosets

Published

Journal Article

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 A, with an equal number of points from each coset of a sublattice A'. One part of the input stream drives a generalized convolutional code whose outputs are cosets of A’, while the other part selects points from these cosets. Several of the new codes are better than those previously known. © 1987 IEEE

Full Text

Duke Authors

Cited Authors

  • Calderbank, AR; Sloane, NJA

Published Date

  • January 1, 1987

Published In

Volume / Issue

  • 33 / 2

Start / End Page

  • 177 - 195

Electronic International Standard Serial Number (EISSN)

  • 1557-9654

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/TIT.1987.1057291

Citation Source

  • Scopus