Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding (Q1345810)
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 733366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding |
scientific article; zbMATH DE number 733366 |
Statements
Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding (English)
0 references
24 August 1995
0 references
VLSI complexity
0 references
algorithms
0 references
arithmetic coding
0 references
excess code length
0 references
0.8681873083114624
0 references
0.8664670586585999
0 references
0.8571529388427734
0 references
0.8141674399375916
0 references
