On Viterbi-like algorithms and their application to Reed-Muller codes (Q1827580)
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: On Viterbi-like algorithms and their application to Reed-Muller codes |
scientific article; zbMATH DE number 2083579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Viterbi-like algorithms and their application to Reed-Muller codes |
scientific article; zbMATH DE number 2083579 |
Statements
On Viterbi-like algorithms and their application to Reed-Muller codes (English)
0 references
6 August 2004
0 references
New methods are proposed for computing the metrics in Viterbi-like algorithms. The partition-of-index-set method is shown to be near-optimal and is applied to decoding Reed-Muller codes. In some cases, this leads to reduced decoding complexity.
0 references
sectionalized trellis
0 references
maximum-likelihood decoding
0 references
0 references
