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.











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)