Lecture Notes in Computer Science, No. 781, pp. 263-269, Springer-Verlag, 1994.
Gregory KABATIANSKI
Institute for Problems of Information Transmission
Ermolovoy 19, Moscow GSP-4, Russia
&
Antoine LOBSTEIN
Centre National de la Recherche Scientifique
Ecole Nationale Supérieure des Télécommunications
46 rue Barrault, 75634 Paris cédex 13, France
Abstract. We establish a new upper bound for binary arithmetic codes, which is asymptotically better than previously known bounds. We also discuss possible "candidates" such as Plotkin and Elias bounds for arithmetic codes over an arbitrary alphabet.
Acknowledgment. The second author is greatly indebted to the first one for inviting him for a 6-week stay at the Institute for Problems of Information Transmission.