A Method for the Construction of Minimum-Redundancy Codes
From MaRDI portal
Publication:5510070
Recommendations
Cited in
(only showing first 100 items - show all)- On compressing permutations and adaptive sorting
- Randomized group testing both query-optimal and minimal adaptive
- Compressing table data with column dependency
- On the optimality of a simple prefix code
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Mining Compressing Sequential Patterns
- Identification for Sources
- Identification Entropy
- Variable-length codes independent or closed with respect to edit relations
- On undetected redundancy in the Burrows-Wheeler transform
- Is Huffmann coding dead?
- Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes
- A note on the construction of error detecting/correcting prefix codes
- Optimal skeleton Huffman trees
- An extension of Khrapchenko's theorem
- On the redundancy of D-ary Fano codes
- scientific article; zbMATH DE number 3478758 (Why is no real title available?)
- Worst-case analysis of the iterated longest fragment algorithm
- In-place calculation of minimum-redundancy codes
- Weighted height of random trees
- Maximizing Wiener index for trees with given vertex weight and degree sequences
- The design and implementation of the Gecko NFS Web proxy
- New bounds on \(D\)-ary optimal codes
- New compression schemes for natural number sequences
- Optimal skeleton and reduced Huffman trees
- Optimum alphabetic binary trees
- On the relation between the maximum entropy principle and the principle of least effort
- Proof pearl: Mechanizing the textbook proof of Huffman's algorithm
- scientific article; zbMATH DE number 3924667 (Why is no real title available?)
- Optimal Sets of Questions for Twenty Questions
- Optimum extensions of prefix codes.
- Practical Wavelet Tree Construction
- On the Huffman and alphabetic tree problem with general cost functions
- scientific article; zbMATH DE number 3463523 (Why is no real title available?)
- Joint image compression-encryption scheme using entropy coding and compressive sensing
- The topology of language
- Construction of minimum bandwidth regenerating codes with combinatorial design
- Worst-Case Optimal Adaptive Prefix Coding
- Grammar compressed sequences with rank/select support
- A complementary view on the growth of directory trees
- Efficient fully-compressed sequence representations
- Conjectures on optimal nested generalized group testing algorithm
- Dynamic Shannon coding
- Decision problems under uncertainty based on entropy functionals
- Random walks and diffusion on networks
- An efficient decoding technique for Huffman codes
- The finite automata approaches in stringology
- Correctness of constructing optimal alphabetic trees revisited
- Efficient and compact representations of some non-canonical prefix-free codes
- Lightweight compression with encryption based on asymmetric numeral systems
- A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Generalized Huffman coding for binary trees with choosable edge lengths
- A joint representation of Rényi's and Tsalli's entropy with application in coding theory
- A million answers to twenty questions: choosing by checklist
- Synchronizing codewords of \(q\)-ary Huffman codes
- Fast decoding algorithms for variable-lengths codes
- Compressing probability distributions
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- The F-transform preprocessing for JPEG strong compression of high-resolution images
- 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
- Sterrett procedure for the generalized group testing problem
- Prefix codes: Equiprobable words, unequal letter costs
- Optimal representation in average using Kolmogorov complexity
- Complexity Questions in Non-Uniform Random Variate Generation
- Parallel construction of binary trees with near optimal weighted path length
- Efficient Huffman decoding
- Partitions with minimum entropy of regions in \(\mathbb R^{2}\)
- Efficient Associative Computation with Discrete Synapses
- Reflections on Optimal and Nearly Optimal Binary Search Trees
- Alphabetic coding with exponential costs
- A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Efficient quantum secure direct communication protocol based on quantum channel compression
- Coding strategies in language
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Joint compression and encryption using chaotically mutated Huffman trees
- Lempel-Ziv-78 compressed string dictionaries
- scientific article; zbMATH DE number 3463524 (Why is no real title available?)
- 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
- Space-efficient Huffman codes revisited
- Generating probabilities with a specified entropy
- Optimal binary trees with order constraints
- The cut operation in subclasses of convex languages
- Protein Sequence Comparison Method Based on 3-ary Huffman Coding
- Multigram codes (Corresp.)
- Forward looking Huffman coding
- De Novo NGS Data Compression
- Compror: On-line lossless data compression with a factor oracle.
- Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
- Image compression with anisotropic diffusion
- Exact and approximation algorithms for error-detecting even codes
- Compact structure for sparse undirected graphs based on a clique graph partition
- Image coding based on maximum entropy partitioning for identifying improbable intensities related to facial expressions
- Geometric compression of a quadrilateral mesh
- Compressed depth sequences
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)
