Pages that link to "Item:Q4177462"
From MaRDI portal
The following pages link to A unified approach to weak universal source coding (Q4177462):
Displaying 6 items.
- Effective complexity of stationary process realizations (Q400883) (← links)
- A lower-bound for the maximin redundancy in pattern coding (Q845432) (← links)
- A lower bound on compression of unknown alphabets (Q1770393) (← links)
- A Bernstein-von Mises theorem for discrete probability distributions (Q1951969) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- (Q3331118) (← links)