List decoding in a Gaussian channel
From MaRDI portal
In the paper the decoding error probability is investigated. The feature of the treatment lies in the fact that the decoding result is not a single word but a sequence of \(L\) code words with the maximum value of the likelihood function. After introducing some specific concepts such as the list distance, the Euclidean and Hamming one are discussed. Finally, some examples of application are presented. Also, a geometric interpretation of the list distance is given.
Recommendations
Cited in
(10)- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
- Error probability exponent of list decoding at low rates
- On the complexity of suboptimal decoding for list and decision feedback schemes
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
- List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability
- An Improved Bound on the List Error Probability and List Distance Properties
- The smallest list for the arbitrarily varying channel
- Improving the generalized likelihood ratio test for unknown linear gaussian channels
- List-Decoding for the Arbitrarily Varying Channel Under State Constraints
- List-Decoding with Double Samplers
This page was built for publication: List decoding in a Gaussian channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179607)