Using tries for universal data compression
From MaRDI portal
Recommendations
- Dynamical sources in information theory: A general analysis of trie structures
- Digital trees and memoryless sources: from arithmetics to analysis
- Algorithms for trie compaction
- The Ubiquitous Digital Tree
- Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
This page was built for publication: Using tries for universal data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154678)