Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure

DOI10.1109/TIT.2004.830763MaRDI QIDQ3547324zbMATH OpenOpenAlexFDO

Authors Álvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2004.830763

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Source coding (94A29)

Recommendations

• A universal finite memory source
• On encoding and decoding with two-way head machines
• Fast universal coding with context models
• The context-tree weighting method: basic properties
• Tree encoding of memoryless time-discrete sources with a fidelity criterion

Cited in

(2)

• Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
• Estimating Entropy Rates with Bayesian Confidence Intervals

This page was built for publication: Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547324)