This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes
February 1975 (vol. 24 no. 2)
pp. 210-212
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.
Index Terms:
Arithmetic codes, capabilities of codes, error-detecting codes, low-cost codes, mass storage devices, multiple errors, repeated-use faults.
Citation:
J.F. Wakerly, "Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes," IEEE Transactions on Computers, vol. 24, no. 2, pp. 210-212, Feb. 1975, doi:10.1109/T-C.1975.224187
Usage of this product signifies your acceptance of the Terms of Use.