Can Burrows-Wheeler transform be replaced in chain code compression? (Q2663576)
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 7334885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Can Burrows-Wheeler transform be replaced in chain code compression? |
scientific article; zbMATH DE number 7334885 |
Statements
Can Burrows-Wheeler transform be replaced in chain code compression? (English)
0 references
19 April 2021
0 references
Burrows-Wheeler transform
0 references
move-to-front transform
0 references
prediction
0 references
chain codes
0 references
lossless compression
0 references
0 references
0.7588873505592346
0 references
0.6828546524047852
0 references
0.6774424910545349
0 references
0.6707121133804321
0 references
0.6687760949134827
0 references
