On a coding theorem connected with Rényi's entropy
From MaRDI portal
Publication:4103015
DOI10.1016/S0019-9958(75)90404-0zbMath0335.94014MaRDI QIDQ4103015
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
Related Items
Some properties of Rényi entropy over countably infinite alphabets ⋮ On Unified (R,S)-Information Measures ⋮ Trees with exponentially growing costs ⋮ Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \) ⋮ On Noiseless Coding ⋮ On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\)