In a previous paper [1], B. Dimsdale and I reported on the use of programmed Hamming codes for error correction on a 7090. The paper generated much interest, but several readers remarked that they could not use the technique on their decimal machines since they could not manipulate the bit structure of the characters. This paper presents a modification of Hamming's technique to adapt it to such machines. It generalizes to any number base for which addition is built into the machine, and so could be used for alphabetic error correction on a machine where such operations as (A + B, literally) or (R+2, literally) or (H + $, literally) are unequivocally defined. The technique will be described for single strings of characters, but may be generalized to parallel techniques if parallel, no-carry addition is available on the machine in question.
The Latest from CACM
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment