1. W.W. Peterson, E.J. Weldon, Jr.: Error-correcting codes. Cambridge: MIT Press 1972

   Google Scholar 

2. J.L. Massey, O.N. Garcia: Error-correcting codes in computer arithmetics. In: Advances in Information Systems Science 4, New York-London: Plenum Press 1972, Ch. 5

   Google Scholar 

3. G.A. Kabatianski: Bounds on the number of code words in binary arithmetic codes. Problems of Information Transmission 12-4, 277–283 (1976)

   Google Scholar 

4. R.J. McEliece, E.R. Rodemich, H.C. Rumsey, Jr., L.R. Welch: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE IT-23, 157–166 (1977)

   Google Scholar 

5. E.R. Berlekamp (ed.): Key papers in the development of coding theory. New-York IEEE Press 1974

   Google Scholar 

6. L.A. Bassalygo: New upper bounds for codes correcting errors. Problems of Information Transmission 6-4, 41–45 (1965), in Russian

   Google Scholar 

7. P. Solé: A Lloyd theorem in weakly metric association schemes. Europ. J. Combinatorics 10, 189–196 (1989)

   Google Scholar 

8. Ph. Delsarte: An algebraic approach to the association schemes of coding theory. Philips Research Reports Suppl. 10, 1973

   Google Scholar 

9. V.I. Levenshtein: Designs as maximum codes in polynomial metric spaces. Acta Applicandae Mathematicae 25, 1–I, 1992

   Google Scholar 

10. I.M. Boyarinov, G.A. Kabatianski: Arithmetic (n,A)-codes over an arbitrary base. Sov. Phys. Dokl. 20-4, 247–249 (1975)

    Google Scholar 

11. W.E. Clark, J. J. Liang: On modular weight and cyclic nonadjacent forms for arithmetic codes. IEEE-IT 20, 767–770 (1974)

    Google Scholar 

12. S. Ernvall: On bounds for nonbinary arithmetic codes. Ars Combinatoria 29-B, 85–89 (1990)

    Google Scholar 

Download references