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.>
Cited by 23 works. doi:10.1109/18.272477
Authors
References
- A Mathematical Theory of Communication
- An Introduction to Probability Theory and its Applications.
- Information Theory: Coding Theorems for Discrete Memoryless Systems
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)
- Efficient Generation of Optimal Prefix Code
- Synthesis of noiseless compression codes
- Full decodable code-word sets
- Channels which transmit letters of unequal duration
- Simple proofs of some theorems on noiseless channels
- Information sources with different cost scales and the principle of conservation of entropy