No label defined (Q4242278)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1285527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1285527 |
Statements
10 May 1999
0 references
Markov source
0 references
redundancy
0 references
low entropy
0 references
data compression
0 references
0.8562456965446472
0 references
0.8560360670089722
0 references
0.8113735914230347
0 references
The problem of coding a binary Markov source with unknown statistics is studied. An effective scheme of low-entropy source coding is proposed. A finite-state Markov source has low entropy if \( p'=\max\limits_{s\in S}p(1\mid{}s)\) is small, where \(S\) is the set of states. The method of coding provides an arbitrary prescribed redundancy \(r>0\). The average time of encoding and decoding per one symbol is equal to \[ O\Bigl(\frac{p'}{\sqrt{p(1)}}\log^3\frac{1}{r}\log\log\frac{1}{r}\Bigr) \] bit-operations. This method uses the sliding window of length \(2/r\) and is based on a fast code by \textit{B. Ya. Ryabko} [IEEE Trans. Inf. Theory 40, No. 1, 96-99 (1994; Zbl 0803.94007)].
0 references