No label defined (Q4500978)
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 1498788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1498788 |
Statements
3 September 2000
0 references
combinatorial source coding
0 references
arithmetic coding
0 references
computational complexity
0 references
0.8103001713752747
0 references
0.7982834577560425
0 references
0.7858953475952148
0 references
The computational complexity of available combinatorial and arithmetic coding techniques is polynomial in the length of the coded sequence. A coding procedure is constructed whose efficiency is close to the combinatorial coding efficiency and which has low computational complexity of coding and decoding. It represents a kind of variable-length coding. The redundancy of the new algorithm for the binary sequence of length \(n\) admits an upper bound \(0,0868k\) for \(n\leq 256\). For small \(k\), the average redundancy is as follows: 1) \(r(n,k)\leq 1\) for \(k\leq 17\) and \(n\leq 256\); 2) \(r(n,k)\leq 1\) for \(n\leq 49\) and \(k\leq n\). For the entire collection see [Zbl 0918.00043].
0 references
