Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
John F. Wakerly (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: