Abstract | ||
---|---|---|
Variants of classical data compression paradigms by Ziv, Lempel, and Welch are proposed in which the phrases used in compression are selected among suitably chosen strings of intermittently solid and wild characters produced by the autocorrelation of the sourcestring. Adaptations and extensions of the classical ZL78 paradigm as implemented by Welch are developed along these lines, and they are easily seen to be susceptible of simple linear time implementation. Both lossy and lossless schemata are considered, and preliminary analyses of performance are attempted. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1016/j.ic.2007.03.001 | Inf. Comput. |
Keywords | Field | DocType |
zl78 paradigm,wild character,gapped variant,data compression by textual substitution,design and analysis of algorithms,welch compression,lossless schema,pattern matching,compression paradigm,ziv–lempel–welch phrase parse,trie,lossy compression,preliminary analysis,simple linear time implementation,classical data,data compression,linear time | Lossy compression,Lempel–Ziv–Welch,Computer science,Algorithm,Theoretical computer science,Time complexity,Data compression,Trie,Pattern matching,Lossless compression,Autocorrelation | Journal |
Volume | Issue | ISSN |
205 | 7 | Information and Computation |
Citations | PageRank | References |
5 | 0.47 | 14 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alberto Apostolico | 1 | 1441 | 182.20 |