A Method for the Construction of Minimum-Redundancy Codes
From MaRDI portal
Publication:5510070
DOI10.1109/JRPROC.1952.273898zbMATH Open0137.13605WikidataQ54105217 ScholiaQ54105217MaRDI QIDQ5510070FDOQ5510070
Authors: David A. Huffman 
Publication date: 1952
Published in: Proceedings of the IRE (Search for Journal in Brave)
Recommendations
Cited In (only showing first 100 items - show all)
- On compressing permutations and adaptive sorting
- Compressing table data with column dependency
- Mining Compressing Sequential Patterns
- On undetected redundancy in the Burrows-Wheeler transform
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Is Huffmann coding dead?
- An extension of Khrapchenko's theorem
- Weighted height of random trees
- On the Huffman and alphabetic tree problem with general cost functions
- Worst-Case Optimal Adaptive Prefix Coding
- Efficient fully-compressed sequence representations
- Generalized Huffman coding for binary trees with choosable edge lengths
- A million answers to twenty questions: choosing by checklist
- Fast decoding algorithms for variable-lengths codes
- Efficient Huffman decoding
- Partitions with minimum entropy of regions in \(\mathbb R^{2}\)
- Efficient quantum secure direct communication protocol based on quantum channel compression
- Title not available (Why is that?)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Comment on ``Efficient Huffman decoding and ``An efficient finite-state machine implementation of Huffman decoders
- A memory-efficient and fast Huffman decoding algorithm
- A novel block-based scheme for arithmetic coding
- Compror: On-line lossless data compression with a factor oracle.
- Fuzzy concept lattice reduction using Shannon entropy and Huffman coding
- Exact and approximation algorithms for error-detecting even codes
- An optimum encoding with minimum longest code and total number of digits
- Huffman coding with non-sorted frequencies
- Implementation of directed acyclic word graph.
- Optimal binary search trees
- A new protocol for the detection of node replication attacks in mobile wireless sensor networks
- Optimal detection of a counterfeit coin with multi-arms balances
- An efficient raster font compression for embedded systems
- On the balanced minimum evolution polytope
- Testing the optimality of alphabetic trees
- Textual data compression in computational biology: algorithmic techniques
- Two-base numeration systems
- Constructing binary Huffman tree
- A fast dynamic compression scheme for natural language texts
- A simpler analysis of Burrows-Wheeler-based compression
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Neural associative memory for brain modeling and information retrieval
- On finding minimal length superstrings
- A generalization of circulant Hadamard and conference matrices
- Approximate string matching on Ziv--Lempel compressed text
- Optimal Skeleton Huffman Trees Revisited
- A note on growing binary trees
- Robust universal complete codes for transmission and compression
- A sensor-based framework for kinetic data compression
- Information lower bounds via self-reducibility
- Two new perspectives on multi-stage group testing
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- A dynamical systems proof of Kraft-McMillan inequality and its converse for prefix-free codes
- Enumerating vertices of the balanced minimum evolution polytope
- Approximation Algorithms for Key Management in Secure Multicast
- A criticism of the ACW algorithm
- The memory center
- Effective dimensions and relative frequencies
- Wavelet trees for all
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Protocols for asymmetric communication channels
- Lossless image compression based on multiple-tables arithmetic coding
- A novel lossless data compression scheme based on the error correcting Hamming codes
- An adaptive character wordlength algorithm for data compression
- Improved bounds for asymmetric communication protocols.
- Information dynamics at a phase transition
- On the generalization and improvement of QSDC efficiency achieved through a quantum channel compression
- Parallel lossless image compression using Huffman and arithmetic coding
- Context adaptive residual coding for efficient compression of MCEEG employing wave atom transforms
- Algorithmic information and simplicity in statistical physics
- Big data naturally rescaled
- Randomized group testing both query-optimal and minimal adaptive
- Variable-length codes independent or closed with respect to edit relations
- A note on the construction of error detecting/correcting prefix codes
- Title not available (Why is that?)
- On the redundancy of \(D\)-ary Fano codes
- New bounds on \(D\)-ary optimal codes
- Title not available (Why is that?)
- Proof pearl: Mechanizing the textbook proof of Huffman's algorithm
- The topology of language
- The finite automata approaches in stringology
- A complementary view on the growth of directory trees
- Decision problems under uncertainty based on entropy functionals
- Dynamic Shannon coding
- Random walks and diffusion on networks
- Correctness of constructing optimal alphabetic trees revisited
- Synchronizing codewords of \(q\)-ary Huffman codes
- Compressing probability distributions
- Efficient Associative Computation with Discrete Synapses
- Area and power reduction of embedded DSP systems using instruction compression and re-configurable encoding
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation
- Development of two new mean codeword lengths
- Parallel construction of binary trees with near optimal weighted path length
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- Alphabetic coding with exponential costs
- Joint compression and encryption using chaotically mutated Huffman trees
- Lempel-Ziv-78 compressed string dictionaries
- Image compression with anisotropic diffusion
- Set Orderings Requiring Costliest Alphabetic Binary Trees
- Geometric compression of a quadrilateral mesh
This page was built for publication: A Method for the Construction of Minimum-Redundancy Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510070)
