Fast decoding algorithms for variable-lengths codes
DOI10.1016/J.INS.2011.06.019zbMATH Open1239.68031OpenAlexW1998282452WikidataQ62629209 ScholiaQ62629209MaRDI QIDQ424795FDOQ424795
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- A Method for the Construction of Minimum-Redundancy Codes
- Universal codeword sets and representations of the integers
- Run-length encodings (Corresp.)
- Robust transmission of unbounded strings using Fibonacci representations
- Title not available (Why is that?)
- Organization and maintenance of large ordered indexes
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Title not available (Why is that?)
- An experimental study of a compressed index
- Optimal encoding of non-stationary sources
Cited In (5)
- Fast tabular decoding method for multi-delimiter codes
- A fast algorithm for the unique decipherability of multivalued encodings
- 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
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)
