DocumentCode :
892900
Title :
Coset codes. I. Introduction and geometrical classification
Author :
Forney, G. David, Jr.
Author_Institution :
Codex Corp., Canton, MA, USA
Volume :
34
Issue :
5
fYear :
1988
fDate :
9/1/1988 12:00:00 AM
Firstpage :
1123
Lastpage :
1151
Abstract :
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
Keywords :
codes; decoding; encoding; errors; telecommunication channels; bandlimited channels; binary encoder; coding gain; coding techniques; constellation expansion factor; coset codes; decoding complexity; error coefficient; lattice codes; lattice partition; trellis-coded modulation schemes; Channel capacity; Constellation diagram; Convolutional codes; Decoding; Helium; History; Lattices; Modems; Modulation coding; Multidimensional systems;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.21245
Filename :
21245
Link To Document :
بازگشت