Development of two new mean codeword lengths

DOI10.1016/J.INS.2012.04.020MaRDI QIDQ713428zbMATH OpenOpenAlexFDO

Authors Om Parkash, Priyanka Kakkar

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

entropybest 1-to-1 codemean codeword lengthuniquely decipherable code

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Recommendations

• Publication:3474585
• Construction of new codes and its related parameters
• On the average codeword length of optimal binary codes for extended sources (Corresp.)
• scientific article; zbMATH DE number 1281944
• scientific article; zbMATH DE number 4156353
• scientific article; zbMATH DE number 2065860
• scientific article; zbMATH DE number 3920367
• New coding algorithm based on variable-length codewords for piecewise uniform quantizers
• Two new binary codes obtained by shortening a generalized concatenated code

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 4141942 (Why is no real title available?)
• scientific article; zbMATH DE number 4156353 (Why is no real title available?)
• A new class of fuzzy coding theorems
• Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order and type

This page was built for publication: Development of two new mean codeword lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713428)