Some notes on Varn coding

Serap A. Savari · IEEE Transactions on Information Theory · 1994

A duality between Varn (1971) coding and Tunstall (1968) coding is demonstrated and new bounds on the expected transmission cost per source symbol for Varn codes are established. For binary channels, the superiority of the new upper bound over Krause's (1962) upper bound is proven.>

Read the paper · More papers on PaperTik