Abstract
H. Imai and S. Hirakawa have proposed (1977) a multilevel coding method based on binary block codes that admits a staged decoding procedure. The author extends the coding method to coset codes and shows how to calculate minimum squared distance and path multiplicity in terms of the norms and multiplicities of the different cosets. The multilevel structure allows the redundancy in the coset selection procedure to be allocated efficiently among the different levels. It also allows the use of suboptimal multistage decoding procedures that have performance/complexity advantages over maximum-likelihood decoding.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Decoding methodsCosetAlgorithmRedundancy (engineering)List decodingCoding (social sciences)Binary numberComputer scienceBlock codeMathematicsBinary codeSequential decodingTheoretical computer scienceDiscrete mathematicsArithmeticStatisticsConcatenated error correction code
Affiliated Institutions
Related Publications
Multilevel trellis coded modulations for the Rayleigh fading channel
The authors present coded 8-phase-shift-keyed (8-PSK) modulations for the Rayleigh fading channel. The schemes are based on multilevel trellis-coded-modulation constructions and...
New trellis codes based on lattices and cosets
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 ...
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....
Geometrically uniform codes
A signal space code C is defined as geometrically uniform if, for any two code sequences in C, there exists an isometry that maps one sequence into the other while leaving the c...
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length o...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 37
- Issue
- 3
- Pages
- 222-229
- Citations
- 236
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
236
OpenAlex
Cite This
A.R. Calderbank
(1989).
Multilevel codes and multistage decoding.
IEEE Transactions on Communications
, 37
(3)
, 222-229.
https://doi.org/10.1109/26.20095
Identifiers
- DOI
- 10.1109/26.20095