Abstract

Data records in secondary storage have some inherent redundancy of information. This redundancy cannot precisely be predicted as in the case of typical error correction scheme’s artificial redundancy. However, the redundancy can be exploited to provide error correction with some degree of confidence. To that end, we develop a statistical error location and correction (SELAC) approach. We use simple and weighted checksum schemes for error detection and present algorithms for single and multiple error correction using SELAC. An implementation of SELAC will be described with an elaborate study of its error correction capabilities. A conspicuous aspect of SELAC is that it will not cost any processor time and storage overhead until after an error is encountered unlike the classical schemes using SEC-DED and DEC-TED codes.KeywordsError CorrectionError LocationData BlockSingle ErrorBurst ErrorThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.