Name
Abstract | ||
|---|---|---|
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at preventing expansion of the encoded string for data whose statistics deviate from those represented by the machines. The resulting algorithm is shown to have superior compression of short files compared to other methods. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/DCC.2005.50 | DCC |
Keywords | Field | DocType |
robust escape method,compression system,superior compression,short file,resulting algorithm,lossless data compression,statistics deviate,lossless data,optimal tree machines,tree machines,encoded string,databases,sequences,signal processing,data compression,statistics,encoding,tree data structures,information retrieval,internet,robustness,training data | ENCODE,Signal processing,Lossy compression,Computer science,Tree (data structure),Robustness (computer science),Theoretical computer science,Data compression,Lossless compression,Encoding (memory) | Conference |
ISSN | ISBN | Citations |
1068-0314 | 0-7695-2309-9 | 4 |
PageRank | References | Authors |
0.53 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gergely Korodi | 1 | 78 | 5.57 |
| Jorma Rissanen | 2 | 1665 | 798.14 |
| Ioan Tabus | 3 | 276 | 38.23 |