Coding Theory

On Bounds on the Number of Code Words in Binary Arithmetic Codes

G. A. Kabatiansky


Abstract: Improvements are obtained for the asymptotic bounds for binary arithmetic codes (analogous to the Hamming and Gilbert bounds). It is shown that there exist many different classes of $AN$-codes on which the limit of “exhaustion” (Gilbert bound) is achieved for arithmetic codes. A similar result is obtained for additive truncated cyclic codes.

UDC: 621.391.15:519.14

Received: 30.01.1975

 English version: Problems of Information Transmission, 1976, 12:4, 277–283

Bibliographic databases:

• 
•