On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications

DOI10.1007/S11086-008-1007-1zbMATH Open1184.94279OpenAlexW4249116750MaRDI QIDQ840002FDOQ840002

A. V. Inyukhin

Publication date: 4 September 2009

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11086-008-1007-1

Recommendations

• Self-checking decoding algorithm for Reed-Solomon codes
• Reflections about a single checksum
• scientific article; zbMATH DE number 2130435
• Algorithmic Fault Tolerance Using the Lanczos Method
• Decoding of Reed Solomon codes beyond the error-correction bound

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (1)

• Designing Checksums for Detecting Errors in Fast Unitary Transforms

This page was built for publication: On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications

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