On Noiseless Coding

DOI10.1080/02522667.1984.10698790zbMath0539.94010OpenAlexW2062983251MaRDI QIDQ3328439

Prem Nath

Publication date: 1984

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1984.10698790

zbMATH Keywords

admissible measures of code lengthprobabilistic coding theoryShannon-Fano type theorem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Recursive density types and Nerode extensions of arithmetic
• On a coding theorem connected with Rényi's entropy
• Determination of all additive quasiarithmetic mean codeword lengths
• A generalization of shannon's inequality and its application in coding theory
• A coding theorem and Rényi's entropy
• Generalized information functions
• On a Functional Equation

This page was built for publication: On Noiseless Coding