Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient Huffman decoding

From MaRDI portal
Publication:286977
Jump to:navigation, search

DOI10.1016/S0020-0190(96)00204-9zbMath1336.68045MaRDI QIDQ286977

F. Blanchet-Sadri, M. Dambrine

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

data structuresdecoding algorithmsHuffman code


Mathematics Subject Classification ID

Data structures (68P05) Decoding (94B35)


Related Items (5)

An efficient finite-state machine implementation of Huffman decoders ⋮ Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders ⋮ A memory-efficient and fast Huffman decoding algorithm ⋮ An improved algorithm for solving the banded cyclic string-to-string correction problem ⋮ An efficient decoding technique for Huffman codes



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Memory efficient and high-speed search Huffman coding
  • A Method for the Construction of Minimum-Redundancy Codes




This page was built for publication: Efficient Huffman decoding

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:286977&oldid=12169628"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki