Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
From MaRDI portal
Publication:4857490
DOI10.1109/18.391235zbMath0835.94020OpenAlexW2128657901MaRDI QIDQ4857490
Publication date: 15 April 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.391235
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Cyclic codes (94B15) Decoding (94B35) Distributed algorithms (68W15)
This page was built for publication: Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials