Random access to Fibonacci encoded files

DOI10.1016/J.DAM.2015.11.003zbMATH Open1350.68076OpenAlexW2210420966MaRDI QIDQ313776FDOQ313776

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

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

Cites Work

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

Cited In (6)

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

Uses Software

• PATRICIA

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)