No label defined (Q4664706)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2154151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2154151 |
Statements
8 April 2005
0 references
soft-decision stack decoding
0 references
binary Reed-Muller code
0 references
0.8535184860229492
0 references
0.8461958169937134
0 references
0.8451269865036011
0 references
0.8450837135314941
0 references
0.8441316485404968
0 references
The authors' summary: ``The performance of a stack algorithm for decoding binary Reed-Muller codes is investigated. As a metric for evaluating different elements in the stack we use a recently derived lower bound on the squared Euclidean distance. It comprises a lower bound on the metric increase in future decoding steps, similar to the \(A^{*}\)-algorithm. Simulation results show that the maximum-likelihood decoding performance can be achieved in the case of the code RM\((3,8)\) at the word error rate \(10^{-3}\) with reasonable stack size close to soft-decision.'' For the entire collection see [Zbl 0944.00096].
0 references