Self-checking decoding algorithm for Reed-Solomon codes

DOI10.1007/3-540-58265-7_8MaRDI QIDQ4637805zbMATH OpenOpenAlexFDO

Authors I. M. Boyarinov

Publication date 26 April 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58265-7_8

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )
• Two new decoding algorithms for Reed-Solomon codes
• Simple algorithms for decoding systematic Reed-Solomon codes
• scientific article; zbMATH DE number 4008275
• Decoding of Reed Solomon codes beyond the error-correction bound

Cites work

• Fault-Tolerant Decoders for Cyclic Error-Correcting Codes
• scientific article; zbMATH DE number 3661254 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)

Cited in

(4)

• Totally Self-Checking Checkers for Low-Cost Arithmetic Codes
• scientific article; zbMATH DE number 1498793 (Why is no real title available?)
• Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2 m )
• On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications

This page was built for publication: Self-checking decoding algorithm for Reed-Solomon codes

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