Title :
An asymptotic bound on the distance of arithmetic codes
fDate :
3/1/1974 12:00:00 AM
Abstract :
An asymptotic bound on the minimum distance is derived to show the existence of good high-rate multiple-error-correcting arithmetic codes.
Keywords :
Arithmetic codes; Arithmetic; Chebyshev approximation; Convolutional codes; Electrons; Error correction; Error correction codes; Helium; Induction generators; Linear code;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1974.1055199
