Compror: On-line lossless data compression with a factor oracle.

DOI10.1016/S0020-0190(01)00308-8zbMath1043.68083OpenAlexW2121675498MaRDI QIDQ1853024

Thierry Lecroq, Arnaud Lefebvre

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00308-8

zbMATH Keywords

AlgorithmsFormal languagesCombinatorial problemsData compressionRepetitionsString algorithmsFactor oracleCombinatorics on wordSuffix link

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items

Substring search and repeat search using factor oracles ⋮ THE STRUCTURE OF FACTOR ORACLES ⋮ Converting suffix trees into factor/suffix oracles ⋮ COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES ⋮ WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING ⋮ Statistical properties of factor oracles ⋮ Statistical Properties of Factor Oracles

Cites Work

• Data compression with factor automata
• Robust universal complete codes for transmission and compression
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• A Method for the Construction of Minimum-Redundancy Codes