Fast algorithms for erasures and error correction in redundant residue number systems
From MaRDI portal
Publication:1312200
DOI10.1007/BF01188092zbMath0782.94018OpenAlexW1989724028MaRDI QIDQ1312200
Publication date: 19 January 1994
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01188092
computational complexityerror detectioncoding theoryminimum distanceerasure correction capabilityerror control in redundant residue number systems
Cites Work
- Unnamed Item
- Unnamed Item
- Fast base extension using a redundant modulus in RNS
- A coding theory approach to error control in redundant residue number systems. I. Theory and single error correction
- A coding theory approach to error control in redundant residue number systems. II. Multiple error detection and correction
- On a class of arithmetic codes and a decoding algorithm (Corresp.)
- On a class of nonlinear arithmetic codes that are easy to decode
- Further results on decoding arithmetic residue codes (Corresp.)
- The Design of Error Checkers for Self-Checking Residue Number Arithmetic
- Error Correction in Residue Arithmetic
- Error Correction in Redundant Residue Number Systems
- Error Correcting Properties of Redundant Residue Number Systems
This page was built for publication: Fast algorithms for erasures and error correction in redundant residue number systems