Fast decoding algorithms for variable-lengths codes

DOI10.1016/J.INS.2011.06.019zbMath1239.68031OpenAlexW1998282452WikidataQ62629209 ScholiaQ62629209MaRDI QIDQ424795

Michal Krátký, Jiří Walder, Radim Bača, Jan Platoš, Václav Snášel

Publication date: 4 June 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.06.019

zbMATH Keywords

data compressionFibonacci codesElias-delta codeElias-Fibonacci codefast decoding algorithms

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60) Decoding (94B35) Prefix, length-variable, comma-free codes (94A45)

Related Items (3)

Lossy-to-lossless 3D image coding through prior coefficient lookup tables ⋮ The memory center ⋮ Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source

Uses Software

• Canterbury

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• Organization and maintenance of large ordered indexes
• Robust transmission of unbounded strings using Fibonacci representations
• Universal codeword sets and representations of the integers
• A Method for the Construction of Minimum-Redundancy Codes
• Run-length encodings (Corresp.)
• An experimental study of a compressed index
• Optimal encoding of non-stationary sources

This page was built for publication: Fast decoding algorithms for variable-lengths codes