A new universal data compression algorithm is described. This algorithm encodes L source symbols at a time. For the class of binary stationary sources, its rate does not exceed [formula omitted] [formula omitted] bits per source symbol. In our analysis, a property of repetition times turns out to be of crucial importance.</p
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
This paper investigates data compression that simultaneously allows local decoding and local update....
Journal PaperRissanen provided a sequential universal coding algorithm based on a block partitioning...
A new universal data compression algorithm is described. This algorithm encodes L source symbols at ...
We study universal compression for discrete data sequences that were corrupted by noise. We show tha...
In [Burrows and Wheeler, 1994] a universal data compression algorithm (BW-algorithm, for short) is d...
Abstract — In this paper, the role of pattern matching information theory is motivated and discussed...
Nowadays, a variety of data-compressors (or archivers) is available, each of which has its merits, a...
ii This thesis concerns sequential-access data compression, i.e., by algorithms that read the input ...
Lossless data compression algorithms can use statistical redundancy to represent data using a fewer ...
The amount of the data in the world enlarges all the time and therefore efficient methods are needed...
This paper proposes a universal variable-length lossless compression algorithm based on fountain cod...
The subject of this article is differential compression , the algorithmic ta...
Two low-complexity methods are proposed for sequential probability assignment for binary i.i.d. indi...
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
This paper investigates data compression that simultaneously allows local decoding and local update....
Journal PaperRissanen provided a sequential universal coding algorithm based on a block partitioning...
A new universal data compression algorithm is described. This algorithm encodes L source symbols at ...
We study universal compression for discrete data sequences that were corrupted by noise. We show tha...
In [Burrows and Wheeler, 1994] a universal data compression algorithm (BW-algorithm, for short) is d...
Abstract — In this paper, the role of pattern matching information theory is motivated and discussed...
Nowadays, a variety of data-compressors (or archivers) is available, each of which has its merits, a...
ii This thesis concerns sequential-access data compression, i.e., by algorithms that read the input ...
Lossless data compression algorithms can use statistical redundancy to represent data using a fewer ...
The amount of the data in the world enlarges all the time and therefore efficient methods are needed...
This paper proposes a universal variable-length lossless compression algorithm based on fountain cod...
The subject of this article is differential compression , the algorithmic ta...
Two low-complexity methods are proposed for sequential probability assignment for binary i.i.d. indi...
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
We characterize the achievable pointwise redundancy rates for lossy data compression at a fixed dist...
This paper investigates data compression that simultaneously allows local decoding and local update....
Journal PaperRissanen provided a sequential universal coding algorithm based on a block partitioning...
DOI
Add to ORKG