Development of two new mean codeword lengths

DOI10.1016/j.ins.2012.04.020zbMath1269.94019MaRDI QIDQ713428

Priyanka Kakkar, Om Parkash

Publication date: 29 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.04.020

zbMATH Keywords

entropy; best 1-to-1 code; mean codeword length; uniquely decipherable code

Mathematics Subject Classification ID

94A17: Measures of information, entropy

94A24: Coding theorems (Shannon theory)

Related Items

Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• An application of Shannon's coding theorem to information transmission in economic markets
• Coding theorem for partial received information
• Some properties of generalized exponential entropies with applications to data compression
• Application of Hölder's inequality in information theory.
• Tight lower bounds for optimum code length (Corresp.)
• A Noiseless Coding Theorem for Sources Having Utilities
• Some equivalences between Shannon entropy and Kolmogorov complexity
• Studies and advances on joint source-channel encoding/decoding techniques in flow media communications
• Secure network coding in the presence of eavesdroppers
• Redundancy-Related Bounds for Generalized Huffman Codes
• Minimum Cost Distributed Source Coding Over a Network
• A Method for the Construction of Minimum-Redundancy Codes
• A coding theorem and Rényi's entropy