Pages that link to "Item:Q5510070"
From MaRDI portal
The following pages link to A Method for the Construction of Minimum-Redundancy Codes (Q5510070):
Displayed 50 items.
- Efficient Huffman decoding (Q286977) (← links)
- Partitions with minimum entropy of regions in \(\mathbb R^{2}\) (Q287135) (← links)
- Comment on ``Efficient Huffman decoding'' and ``An efficient finite-state machine implementation of Huffman decoders'' (Q293392) (← links)
- A memory-efficient and fast Huffman decoding algorithm (Q294633) (← links)
- A novel block-based scheme for arithmetic coding (Q296285) (← links)
- A criticism of the ACW algorithm (Q356211) (← links)
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Fast decoding algorithms for variable-lengths codes (Q424795) (← links)
- Exact and approximation algorithms for error-detecting even codes (Q441883) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- Two-base numeration systems (Q466398) (← links)
- Constructing binary Huffman tree (Q467784) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- The memory center (Q497660) (← links)
- Information lower bounds via self-reducibility (Q504999) (← links)
- Big data naturally rescaled (Q528317) (← links)
- An efficient raster font compression for embedded systems (Q609148) (← links)
- A fast dynamic compression scheme for natural language texts (Q630711) (← links)
- Effective dimensions and relative frequencies (Q650901) (← links)
- A million answers to twenty questions: choosing by checklist (Q665450) (← links)
- On the generalization and improvement of QSDC efficiency achieved through a quantum channel compression (Q670070) (← links)
- Parallel lossless image compression using Huffman and arithmetic coding (Q671379) (← links)
- Algorithmic information and simplicity in statistical physics (Q678643) (← links)
- Is Huffmann coding dead? (Q685866) (← links)
- Huffman coding with non-sorted frequencies (Q691643) (← links)
- Development of two new mean codeword lengths (Q713428) (← links)
- Arithmetic coding as a non-linear dynamical system (Q716619) (← links)
- Joint compression and encryption using chaotically mutated Huffman trees (Q720208) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data (Q742695) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- On the construction of prefix-free and fix-free codes with specified codeword compositions (Q765325) (← links)
- A review on the application of fuzzy transform in data and image compression (Q780186) (← links)
- On the balanced minimum evolution polytope (Q783026) (← links)
- Text compression methods (Q805263) (← links)
- On the redundancy of \(D\)-ary Fano codes (Q831818) (← links)
- Proof pearl: Mechanizing the textbook proof of Huffman's algorithm (Q839031) (← links)
- Dynamic Shannon coding (Q845979) (← links)
- Area and power reduction of embedded DSP systems using instruction compression and re-configurable encoding (Q851224) (← links)
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation (Q851873) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- A novel edge based image steganography with \(2^k\) correction and Huffman encoding (Q894446) (← links)
- New optimization models for designing synchronizing codes (Q922437) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- An adaptive character wordlength algorithm for data compression (Q931760) (← links)
- Weighted height of random trees (Q934911) (← links)
- A novel lossless data compression scheme based on the error correcting Hamming codes (Q950036) (← links)