A Method for the Construction of Minimum-Redundancy Codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Geometric compression of a quadrilateral mesh
- Compressed depth sequences
- Binary search with delayed and missing answers
- The \(S\)-digraph optimization problem and the greedy algorithm
- XML compression techniques: A survey and comparison
- Lossless image compression based on multiple-tables arithmetic coding
- Neural associative memory for brain modeling and information retrieval
- New bounds on \(D\)-ary optimal codes
- Compressing probability distributions
- A short note on the redundancy of degree
- Mathematical optimization and the synchronizing properties of encodings
- On finding minimal length superstrings
- Best Huffman trees
- Huffman's algorithm via algebra
- Testing the optimality of alphabetic trees
- Data compression with factor automata
- Decision problems under uncertainty based on entropy functionals
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- Optimal representation in average using Kolmogorov complexity
- Optimal binary trees with order constraints
- Synchronizing codewords of \(q\)-ary Huffman codes
- Huffman algebras for independent random variables
- Dynamic programming and graph optimization problems
- On polychotomous search problems
- Complexity aspects of guessing prefix codes
- Search problems: One, two or many rounds
- Complete variable-length ``fix-free codes
- On the redundancy achieved by Huffman codes
- The discovery of algorithmic probability
- Correctness of constructing optimal alphabetic trees revisited
- A space-efficient Huffman decoding algorithm and its parallelism
- Worst-case analysis of the iterated longest fragment algorithm
- An efficient decoding technique for Huffman codes
- Protocols for asymmetric communication channels
- A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding
- Operations research applications of dichotomous search
- On partial state matching
- Random walks and diffusion on networks
- Detecting life signatures with RNA sequence similarity measures
- Maximizing Wiener index for trees with given vertex weight and degree sequences
- A joint representation of Rényi's and Tsalli's entropy with application in coding theory
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Minimax trees in linear time with applications
- Finite-state independence
- Huffman codes and maximizing properties of Fibonacci numbers
- Regular expression searching on compressed text
- Approximate string matching on Ziv--Lempel compressed text
- The cost of a class of optimal binary trees
- Compror: On-line lossless data compression with a factor oracle.
- Improved bounds for asymmetric communication protocols.
- Block Huffman coding
- Lossless compression and information hiding in images
- Optimal detection of a counterfeit coin with multi-arms balances
- Parallel construction of binary trees with near optimal weighted path length
- Robust universal complete codes for transmission and compression
- Enumerating vertices of the balanced minimum evolution polytope
- Compact structure for sparse undirected graphs based on a clique graph partition
- Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools
- Variable-length codes independent or closed with respect to edit relations
- Space-efficient Huffman codes revisited
- New compression schemes for natural number sequences
- The F-transform preprocessing for JPEG strong compression of high-resolution images
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- A new weighted (, )-norm information measure with application in coding theory
- The cut operation in subclasses of convex languages (extended abstract)
- Weighted forward looking adaptive coding
- Color image steganography scheme using gray invariant in AMBTC compression domain
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- Optimal skeleton and reduced Huffman trees
- On the Huffman and alphabetic tree problem with general cost functions
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct
- Sterrett procedure for the generalized group testing problem
- Accelerated partial decoding in wavelet trees
- Efficient quantum secure direct communication protocol based on quantum channel compression
- Joint image compression-encryption scheme using entropy coding and compressive sensing
- Image compression with anisotropic diffusion
- Image coding based on maximum entropy partitioning for identifying improbable intensities related to facial expressions
- On the maximum length of Huffman codes
- A fast algorithm for adaptive prefix coding
- Finite state models for perception
- Grammar compressed sequences with rank/select support
- Information dynamics at a phase transition
- Context adaptive residual coding for efficient compression of MCEEG employing wave atom transforms
- A generalization of circulant Hadamard and conference matrices
- A new protocol for the detection of node replication attacks in mobile wireless sensor networks
- Wavelet trees for all
- Online binary minimax trees
- A simpler analysis of Burrows-Wheeler-based compression
- Compressing table data with column dependency
- On the relation between the maximum entropy principle and the principle of least effort
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Generalized Huffman coding for binary trees with choosable edge lengths
- A note on growing binary trees
- Bounds on the weighted path length of binary trees
- Optimum extensions of prefix codes.
- The topology of language
- On the stability of citation networks
- Bidirectional adaptive compression
- Grafting key trees: efficient key management for overlapping groups
- On asymmetric communication protocols
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)
