Decoding of redundant residue polynomial codes using Euclid's algorithm

DOI10.1109/18.21269MaRDI QIDQ3818989zbMATH OpenOpenAlexFDO

Authors Akira Shiozaki

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

zbMATH Keywords

Reed-Solomon codeserasuresconcatenated codeserror-locator polynomialinner codesdecoding methoderror- evaluator polynomial

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Redundant residue polynomial codes
• The decoding of extended Reed-Solomon codes
• Decoding Reed-Solomon codes beyond (d-1)/2 and zeros of multivariate polynomials
• scientific article; zbMATH DE number 4104862
• Decoding residue codes
• Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials
• A New Algorithm for Decoding Reed-Solomon Codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
• Decoding LDPC Codes Over Integer Residue Rings

Cited in

(5)

• Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
• Redundant residue polynomial codes
• Biorthogonal wavelet codes with prescribed code distance
• On decoding algorithms for Goppa codes
• Simple algorithms for decoding systematic Reed-Solomon codes

This page was built for publication: Decoding of redundant residue polynomial codes using Euclid's algorithm

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