Random access to Fibonacci encoded files

DOI10.1016/j.dam.2015.11.003zbMath1350.68076OpenAlexW2210420966MaRDI QIDQ313776

Shmuel T. Klein, Dana Shapira

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.003

zbMATH Keywords

wavelet treesFibonacci codesrank and select

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (6)

A space efficient direct access data structure ⋮ Bidirectional adaptive compression ⋮ Optimal skeleton and reduced Huffman trees ⋮ Forward looking Huffman coding ⋮ Accelerated partial decoding in wavelet trees ⋮ New compression schemes for natural number sequences

Uses Software

• PATRICIA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust universal complete codes for transmission and compression
• Adapting the Knuth-Morris-Pratt algorithm for pattern matching in Huffman encoded texts
• Robust transmission of unbounded strings using Fibonacci representations
• Alphabet Partitioning for Compressed Rank/Select and Applications
• Universal codeword sets and representations of the integers
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• String Processing and Information Retrieval

This page was built for publication: Random access to Fibonacci encoded files