Pages that link to "Item:Q4975701"
From MaRDI portal
The following pages link to Coding on Countably Infinite Alphabets (Q4975701):
Displaying 9 items.
- Some properties of Rényi entropy over countably infinite alphabets (Q383169) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- Alphabetic coding with exponential costs (Q990132) (← links)
- A Bernstein-von Mises theorem for discrete probability distributions (Q1951969) (← links)
- Universal coding for memoryless sources with countably infinite alphabets (Q2352641) (← links)
- A coding theorem for enumerable output machines (Q2390302) (← links)
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets (Q3547014) (← links)
- On Finite Alphabets and Infinite Bases III: Simulation (Q5756593) (← links)
- Foundations of Software Science and Computation Structures (Q5899076) (← links)