Decoding of redundant residue polynomial codes using Euclid's algorithm
From MaRDI portal
Publication:3818989
DOI10.1109/18.21269zbMath0666.94015OpenAlexW2016391699MaRDI QIDQ3818989
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.21269
concatenated codesReed-Solomon codeserasureserror-locator polynomialinner codesdecoding methoderror- evaluator polynomial
Related Items (4)
Simple algorithms for decoding systematic Reed-Solomon codes ⋮ Biorthogonal wavelet codes with prescribed code distance ⋮ Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ On decoding algorithms for Goppa codes
This page was built for publication: Decoding of redundant residue polynomial codes using Euclid's algorithm