A suboptimal lossy data compression based on approximate pattern matching (Q4371886)
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 1106481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A suboptimal lossy data compression based on approximate pattern matching |
scientific article; zbMATH DE number 1106481 |
Statements
A suboptimal lossy data compression based on approximate pattern matching (English)
0 references
14 January 2001
0 references
source coding algorithm
0 references
lossy data compression
0 references
approximate string matching
0 references
lossless Lempel-Ziv data compression scheme
0 references
typical length
0 references
compression rate
0 references
stationary mixing sequences
0 references
0.8683159351348877
0 references
0.8627868890762329
0 references
0.8431744575500488
0 references
