Fast decoding algorithms for variable-lengths codes

DOI10.1016/J.INS.2011.06.019MaRDI QIDQ424795zbMATHOpenAlexWikidataFDO

Authors Jiří Walder, Michal Krátký, 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

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

Recommendations

• Fast tabular decoding method for multi-delimiter codes
• Robust universal complete codes for transmission and compression
• scientific article; zbMATH DE number 5170141
• A simple variable-length code
• Publication:4206688

Cites work

• scientific article; zbMATH DE number 2104341 (Why is no real title available?)
• scientific article; zbMATH DE number 756768 (Why is no real title available?)
• scientific article; zbMATH DE number 5170141 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A fast and efficient nearly-optimal adaptive Fano coding scheme
• An experimental study of a compressed index
• Optimal encoding of non-stationary sources
• Organization and maintenance of large ordered indexes
• Robust transmission of unbounded strings using Fibonacci representations
• Run-length encodings (Corresp.)
• Universal codeword sets and representations of the integers

Cited in

(7)

• Lossy-to-lossless 3D image coding through prior coefficient lookup tables
• The efficient decoding of multi-delimiter code \(C_{2,3,5}\).
• Binary mixed-digit data compression codes
• Fast tabular decoding method for multi-delimiter codes
• The memory center
• Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source
• A fast algorithm for the unique decipherability of multivalued encodings

Describes a project that uses

Uses Software

• Canterbury

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424795)