Abstract :
We show that a low-cost arithmtetic code with group length n detects all unidirectional multiple errors that affect fewer than n bits, as well as a larger class of such errors confined to a restricted set of bit positions.
Keywords :
Arithmetic codes, capabilities of codes, error-detecting codes, low-cost codes, mass storage devices, multiple errors, repeated-use faults.; Arithmetic; Boolean algebra; Bridge circuits; Electrons; Error correction; Error correction codes; Galois fields; Network address translation; Switching circuits; Welding; Arithmetic codes, capabilities of codes, error-detecting codes, low-cost codes, mass storage devices, multiple errors, repeated-use faults.;
