On the Mathematical Theory of Error-Correcting Codes
H. S. Shapiro, D. L. Slotnick · IBM Journal of Research and Development · 1959
Hamming considered the problem of efficient, faultless transmission of binary data over a noisy channel. For a channel which corrupts no more than one binary digit in each sequence of length n, he constructed alphabets, the so-called Hamming codes, which permit error-free signalling. The authors study the analogous problem for channels which can corrupt a greater number of digits. Non-binary channels are also studied, and analogues of the Hamming codes are constructed. It is perhaps of interest that some of the techniques employed derive from algebraic and analytic number theory, mathematical disciplines not generally associated with the type of applied problems considered in this paper.