A bound for arithmetic codes of composite length (Corresp.)
Carlos R. P. Hartmann, Kenneth K. Tzeng · IEEE Transactions on Information Theory · 1972
This correspondence presents an upper bound on the minimum distance of arithmetic codes of composite lengthn = n_1 n_2. The tightness of this bound gives a rather good working estimate of the minimum distance of a prospective code.