Pages that link to "Item:Q2705978"
From MaRDI portal
The following pages link to Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. I: The regular case (Q2705978):
Displaying 9 items.
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- On the redundancy of universal lossless coding for general piecewise stationary sources (Q1429269) (← links)
- Achievable complexity-performance tradeoffs in lossy compression (Q1945149) (← links)
- Asymptotic property of universal lossless coding for independent piecewise identically distributed sources (Q3008560) (← links)
- An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources (Q4503461) (← links)
- A zero-delay sequential scheme for lossy coding of individual sequences (Q4544688) (← links)
- A Single-Shot Approach to Lossy Source Coding Under Logarithmic Loss (Q4566622) (← links)
- Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes (Q5088484) (← links)
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources (Q6139507) (← links)