Abstract
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 <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> -dimensional lattice <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\Lambda</tex> , with an equal number of points from each coset of a sublattice <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\Lambda '</tex> . One part of the input stream drives a generalized convolutional code whose outputs are cosets of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\Lambda '</tex> , while the other part selects points from these cosets. Several of the new codes are better than those previously known.
Keywords
CosetTrellis (graph)LambdaComputer scienceCode (set theory)AlgorithmSet (abstract data type)CombinatoricsDiscrete mathematicsMathematicsDecoding methodsProgramming languagePhysics
Affiliated Institutions
Related Publications
Maximum distanceq-nary codes
A <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</tex> -nary error-correcting code with <tex xmlns:mml="http://www.w3.org/1998/...
On the minimum distance of some quadratic residue codes (Corresp.)
We find the minimum distances of the binary <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(113, 57)</tex> , and ternary <tex xml...
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
An algorithm for computing discrete logarithms over GF <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">(p^{2})</tex> , where <tex ...
Trajectories of nonlinear RLC networks: A geometric approach
The response of a nonlinear time-varying coupled <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RLC</tex> network starting from a...
Low-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed number <tex xmlns:mml="http://www....
Publication Info
- Year
- 1987
- Type
- article
- Volume
- 33
- Issue
- 2
- Pages
- 177-195
- Citations
- 235
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
235
OpenAlex
Cite This
A.R. Calderbank,
N. J. A. Sloane
(1987).
New trellis codes based on lattices and cosets.
IEEE Transactions on Information Theory
, 33
(2)
, 177-195.
https://doi.org/10.1109/tit.1987.1057291
Identifiers
- DOI
- 10.1109/tit.1987.1057291