Pages that link to "Item:Q4103015"
From MaRDI portal
The following pages link to On a coding theorem connected with Rényi's entropy (Q4103015):
Displaying 6 items.
- Some properties of Rényi entropy over countably infinite alphabets (Q383169) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- On a coding theorem connected with entropy of order \(\alpha\) and type \(\beta\) (Q1069903) (← links)
- Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \) (Q2255032) (← links)
- On Noiseless Coding (Q3328439) (← links)
- On Unified (R,S)-Information Measures (Q4846561) (← links)