Random access to Fibonacci encoded files
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3117092 (Why is no real title available?)
- scientific article; zbMATH DE number 3738962 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3435047 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
- Alphabet partitioning for compressed rank/select and applications
- Robust transmission of unbounded strings using Fibonacci representations
- Robust universal complete codes for transmission and compression
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Universal codeword sets and representations of the integers
- \((s,c)\)-dense coding: an optimized compression code for natural language text databases.
Cited in
(6)
This page was built for publication: Random access to Fibonacci encoded files
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313776)