Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.98.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Perfect multiple error-correcting arithmetic codes
HTML articles powered by AMS MathViewer

by Daniel M. Gordon PDF
Math. Comp. 49 (1987), 621-633 Request permission


An arithmetic code is a subgroup of ${{\mathbf {Z}}_{{r^n} \pm 1}}$, with the arithmetic distance $d(x,y) = {\min _t}x - y \equiv \Sigma _{i = 1}^t{c_i}{r^{n(i)}}\;(\bmod {r^n} \pm 1)$, for $|{c_i}| < r$, $n(i) \geqslant 0$ for $1 \leqslant i \leqslant t$. A perfect e-error-correcting code is one from which all $x \in {{\mathbf {Z}}_{{r^n} \pm 1}}$, are within distance e of exactly one codeword. Necessary and sufficient (assuming the Generalized Riemann Hypothesis) conditions for the existence of infinitely many perfect single error-correcting codes for a given r are known. In this paper some conditions for the existence of perfect multiple error-correcting codes are given, as well as the results of a computer search for examples.
  • W. Edwin Clark and J. J. Liang, On arithmetic weight for a general radix representation of integers, IEEE Trans. Inform. Theory IT-19 (1973), 823–826. MR 396060, DOI 10.1109/tit.1973.1055100
  • W. Edwin Clark and J. J. Liang, On modular weight and cyclic nonadjacent forms for arithmetic codes, IEEE Trans. Inform. Theory IT-20 (1974), 767–770. MR 359983, DOI 10.1109/tit.1974.1055301
  • H. Halberstam and H.-E. Richert, Sieve methods, London Mathematical Society Monographs, No. 4, Academic Press [Harcourt Brace Jovanovich, Publishers], London-New York, 1974. MR 0424730
  • Donald E. Knuth, The art of computer programming. Vol. 2, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass., 1981. Seminumerical algorithms. MR 633878
  • H. W. Lenstra, Jr., Perfect Arithmetic Codes, Séminaire Delange-Pisot-Poitou (Théorie des Nombres, 1977/78). J. H. van Lint, Introduction to Coding Theory, Springer-Verlag, New York, 1982.
  • Hans Riesel, Prime numbers and computer methods for factorization, Progress in Mathematics, vol. 57, Birkhäuser Boston, Inc., Boston, MA, 1985. MR 897531, DOI 10.1007/978-1-4757-1089-2
  • Daniel Shanks, Solved and unsolved problems in number theory, 3rd ed., Chelsea Publishing Co., New York, 1985. MR 798284
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11T71, 94B40
  • Retrieve articles in all journals with MSC: 11T71, 94B40
Additional Information
  • © Copyright 1987 American Mathematical Society
  • Journal: Math. Comp. 49 (1987), 621-633
  • MSC: Primary 11T71; Secondary 94B40
  • DOI:
  • MathSciNet review: 906195