In a previous paper , 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 full text of this article is premium content
No entries found
Log in to Read the Full Article
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.