List decoding in a Gaussian channel (Q1179607)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: List decoding in a Gaussian channel |
scientific article; zbMATH DE number 25020
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | List decoding in a Gaussian channel |
scientific article; zbMATH DE number 25020 |
Statements
List decoding in a Gaussian channel (English)
0 references
26 June 1992
0 references
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.
0 references
Hamming distances
0 references
decoding error probability
0 references
likelihood function
0 references
list distance
0 references
