Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic Codes

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.