Pages that link to "Item:Q6139507"
From MaRDI portal
The following pages link to Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources (Q6139507):
Displaying 7 items.
- Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case (Q2705978) (← links)
- Output Constrained Lossy Source Coding With Limited Common Randomness (Q2977297) (← links)
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources (Q4503461) (← links)
- Block-definition approaches to source coding with a fidelity criterion (Q4544458) (← links)
- A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss (Q4566622) (← links)
- On the cost of finite block length in quantizing unbounded memoryless sources (Q4885678) (← links)
- Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes (Q5088484) (← links)