Optimal encoding of non-stationary sources
From MaRDI portal
Publication:5944439
DOI10.1016/S0020-0255(01)00103-7zbMath1031.68534OpenAlexW2088537494MaRDI QIDQ5944439
Publication date: 10 October 2001
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00103-7
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)
Related Items
Fast decoding algorithms for variable-lengths codes ⋮ Lossy-to-lossless 3D image coding through prior coefficient lookup tables ⋮ Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guided tour of Chernoff bounds
- An almost optimal algorithm for unbounded searching
- Universal classes of hash functions
- On-line construction of suffix trees
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- A locally adaptive data compression scheme
- A note on the DMC data compression scheme
- Linear Algorithm for Data Compression via String Matching
- Data compression via textual substitution
- On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
- Universal codeword sets and representations of the integers
- A Space-Economical Suffix Tree Construction Algorithm
- On the Complexity of Finite Sequences
- Economical encoding of commas between strings
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Asymptotic properties of data compression and suffix trees
- Optimal prefetching via data compression
- Error-Resilient Optimal Data Compression
- The macro model for data compression (Extended Abstract)
