![]() |
CiteULike | ![]() |
daniel51's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Coset codes. I. Introduction and geometrical classificationby: G. D. Forney
Information Theory, IEEE Transactions on In Information Theory, IEEE Transactions on, Vol. 34, No. 5. (1988), pp. 1123-1151.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractPractically 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 <e1>C</e1> 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 <e1>C</e1> Λ/Λ'. 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
BibTeX record
RIS record