A linear algebraic interpretation is developed for previously proposed algorithm-based fault tolerance schemes. The concepts of distance, code space, and the definitions of detection and correction in the vector space R/sup n/ are explained. The number of errors that can be detected or corrected for a distance-(d+1) code is derived. It is shown why the correction scheme does not work for general weight vectors, and a novel fast-correction algorithm for a weighted distance-5 code is derived.>
No takes yet. Share an insight, caveat, or question.
Anfinson et al. (1988) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: