A lower bound on average codeword length of variable length error-correcting codes
Margaret Bernard, B. D. Sharma · IEEE Transactions on Information Theory · 1990
Codes of variable length that are capable of error correction are studied. A lower bound on the average length of such codes under the criterion of promptness is obtained. This generalizes the celebrated result due to C.E. Shannon (1948) for the noiseless case. The bound obtained provides a measure of optimality for variable-length, error-correcting codes.>