scientific article; zbMATH DE number 2154151

From MaRDI portal
Publication:4664706





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].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664706)