Using Fibonacci Compression Codes as Alternatives to Dense Codes

No abstract is available for this paper.

• Publication year

  2008

• Venue

  Data Compression Conference

• Publication date

  2008-03-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/DCC.2008.54
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast Decoding of Fibonacci Encoded Texts

  2007cited by this paper
• Accelerating Boyer-Moore searches on binary texts

  2007cited by this paper
• FM-KZ: An even simpler alphabet-independent FM-index

  2006cited by this paper
• Efficiently decodable and searchable natural language adaptive compression

  2005cited by this paper
• (S, C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases

  2003cited by this paper
• An Efficient Compression Code for Text Databases

  2003cited by this paper
• Pattern matching in Huffman encoded texts

  2001cited by this paper
• Evaluation of parallel text alignment systems

  2000cited by this paper
• Evaluation of parallel text alignment systems The ARCADE project

  2000cited by this paper
• Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts

  2000cited by this paper
• Fast and flexible word searching on compressed text

  2000cited by this paper
• Robust Universal Complete Codes for Transmission and Compression

  1996cited by this paper
• Word‐based text compression

  1989cited by this paper
• Robust transmission of unbounded strings using Fibonacci representations

  1987cited by this paper
• A fast string searching algorithm

  1977cited by this paper

• Cambricon-M: A Fibonacci-Coded Charge-Domain SRAM-Based CIM Accelerator for DNN Inference

  2024cites this paper
• Variable-Length Prefix Codes With Multiple Delimiters

  2017cites this paper
• Variable-length Splittable Codes with Multiple Delimiters

  2015cites this paper
• An efficient Variable-to-Fixed length encoding using multiplexed parse trees

  2015cites this paper
• Efficient Variable-to-Fixe d Length Coding Algorithms for Text Compression

  2014cites this paper
• Effective Variable-Length-to-Fixed-Length Coding via a Re-Pair Algorithm

  2013cites this paper
• Prefix Encoding by Means of the $(2,3)$-Representation of Numbers

  2013cites this paper
• A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm

  2013cites this paper
• Two-base numeration systems

  2013cites this paper
• Fast data Encoding and Deconding Algorithms

  2013influential citation
• Fast decoding algorithms for variable-lengths codes

  2012cites this paper
• Boosting Text Compression with Word-Based Statistical Encoding

  2012cites this paper
• Compress Integer with Fibonacci Code and Gamma Code Using Variable-Length code in JPEG 2000

  2011cites this paper
• Improving Parse Trees for Efficient Variable-to-Fixed Length Codes

  2011cites this paper
• Efficient construction of constrained suffix trees

  2011cites this paper
• Lossless R-tree compression using variable-length codes

  2010cites this paper
• Practical fixed length Lempel-Ziv coding

  2010cites this paper
• THE FIBONACCI QUARTERLY

  2010cites this paper
• Fast Fibonacci Encoding Algorithm

  2010cites this paper
• Making dense codes even denser

  2008cites this paper
• Improved Variable-to-Fixed Length Codes

  2008cites this paper
• Huffman Coding with Non-Sorted Frequencies

  2008cites this paper
• Accelerating Boyer-Moore searches on binary texts

  2007cites this paper