Pages that link to "Item:Q913771"
From MaRDI portal
The following pages link to Universal almost sure data compression (Q913771):
Displaying 16 items.
- Application of data compression methods to nonparametric estimation of characteristics of discrete-time stochastic processes (Q941886) (← links)
- Inequalities and algorithms for universal data compression (Q1389278) (← links)
- Limit theorems for random normalized distortion (Q1431553) (← links)
- Selected data compression: a refinement of Shannon's principle (Q1699872) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases (Q1945151) (← links)
- Entropy and compression: a simple proof of an inequality of Khinchin-Ornstein-Shields (Q2190980) (← links)
- Unconditional bases and bit-level compression (Q2564044) (← links)
- Adaptive compression against a countable alphabet (Q2920856) (← links)
- The Generalized Asymptotic Equipartition Property: Necessary and Sufficient Conditions (Q3604574) (← links)
- A universal algorithm for sequential data compression (Q4158937) (← links)
- Bounds on Data Compression Ratio with a Given Tolerable Error Probability (Q4266369) (← links)
- Algorithmic complexity of points in dynamical systems (Q4290052) (← links)
- Stationary Stochastic Processes and Fractal Data Compression (Q4374516) (← links)
- Compression and entropy (Q5096807) (← links)
- Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382) (← links)