On a coding theorem connected with Rényi's entropy

DOI10.1016/S0019-9958(75)90404-0zbMATH Open0335.94014MaRDI QIDQ4103015FDOQ4103015

Authors: Prem Nath 

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Functional equations and inequalities (39B99) Information theory (general) (94A15)

Cited In (6)

• Some properties of Rényi entropy over countably infinite alphabets
• Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \)
• On Noiseless Coding
• On Unified (R,S)-Information Measures
• Trees with exponentially growing costs
• On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\)

This page was built for publication: On a coding theorem connected with Rényi's entropy

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