Fast decoding algorithms for first order Reed-Muller and related codes (Q1910431): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:16, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast decoding algorithms for first order Reed-Muller and related codes |
scientific article |
Statements
Fast decoding algorithms for first order Reed-Muller and related codes (English)
0 references
8 April 1996
0 references
The authors provide fast decoding algorithms for first order Reed-Muller codes and for the Nordstrom-Robinson code. These algorithms are modifications of maximum likelihood decoding and involve only real number operations, more specifically, only additions, subtractions, comparisons and calculations of absolute values.
0 references
fast decoding algorithms
0 references
first order Reed-Muller codes
0 references
Nordstrom-Robinson code
0 references
