By Topic

Coset codes. I. Introduction and geometrical classification

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
$31 $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)
Forney, G.D., Jr. ; Codex Corp., Canton, MA, USA

Practically all known good constructive coding techniques for bandlimited channels, including lattice codes and various trellis-coded modulation schemes, can be characterized as coset codes. A coset code is defined by a lattice partition Λ/Λ' and by a binary encoder C that selects a sequence of cosets of the lattice Λ'. The fundamental coding gain of a coset code, as well as other important parameters such as the error coefficient, the decoding complexity, and the constellation expansion factor, are purely geometric parameters determined by C Λ/Λ'. The known types of coset codes, as well as a number of new classes that systematize and generalize known codes, are classified and compared in terms of these parameters

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 5 )