Issue No. 02 - February (1975 vol. 24)
J.F. Wakerly , Digital Systems Laboratory, Stanford University
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.
Arithmetic codes, capabilities of codes, error-detecting codes, low-cost codes, mass storage devices, multiple errors, repeated-use faults.
J.F. Wakerly, "Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes", IEEE Transactions on Computers, vol. 24, no. , pp. 210-212, February 1975, doi:10.1109/T-C.1975.224187