A Method for the Construction of Minimum-Redundancy Codes

Related Items

Dynamic programming and graph optimization problems ⋮ On polychotomous search problems ⋮ A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding ⋮ A short note on the redundancy of degree $\alpha$ ⋮ Efficient Huffman decoding ⋮ Partitions with minimum entropy of regions in $\mathbb R^{2}$ ⋮ Complexity aspects of guessing prefix codes ⋮ On the redundancy of $D$-ary Fano codes ⋮ 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 ⋮ Proof pearl: Mechanizing the textbook proof of Huffman's algorithm ⋮ Search problems: One, two or many rounds ⋮ Complete variable-length ``fix-free codes ⋮ Dynamic Shannon coding ⋮ Mathematical optimization and the synchronizing properties of encodings ⋮ 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 ⋮ On the redundancy achieved by Huffman codes ⋮ The discovery of algorithmic probability ⋮ A criticism of the ACW algorithm ⋮ Practical and flexible pattern matching over Ziv-Lempel compressed text. ⋮ Two new perspectives on multi-stage group testing ⋮ An efficient raster font compression for embedded systems ⋮ Operations research applications of dichotomous search ⋮ On compressing permutations and adaptive sorting ⋮ On partial state matching ⋮ Correctness of constructing optimal alphabetic trees revisited ⋮ On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case ⋮ Random walks and diffusion on networks ⋮ On finding minimal length superstrings ⋮ A novel edge based image steganography with $2^k$ correction and Huffman encoding ⋮ A fast dynamic compression scheme for natural language texts ⋮ Fast decoding algorithms for variable-lengths codes ⋮ Exact and approximation algorithms for error-detecting even codes ⋮ Best Huffman trees ⋮ Detecting life signatures with RNA sequence similarity measures ⋮ New optimization models for designing synchronizing codes ⋮ Huffman's algorithm via algebra ⋮ Effective dimensions and relative frequencies ⋮ Trees with exponentially growing costs ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ Two-base numeration systems ⋮ Constructing binary Huffman tree ⋮ Efficient fully-compressed sequence representations ⋮ An adaptive character wordlength algorithm for data compression ⋮ A sensor-based framework for kinetic data compression ⋮ Weighted height of random trees ⋮ A million answers to twenty questions: choosing by checklist ⋮ On the generalization and improvement of QSDC efficiency achieved through a quantum channel compression ⋮ Testing the optimality of alphabetic trees ⋮ Parallel lossless image compression using Huffman and arithmetic coding ⋮ Maximizing Wiener index for trees with given vertex weight and degree sequences ⋮ The memory center ⋮ Data compression with factor automata ⋮ Information lower bounds via self-reducibility ⋮ Algorithmic information and simplicity in statistical physics ⋮ A novel lossless data compression scheme based on the error correcting Hamming codes ⋮ A joint representation of Rényi's and Tsalli's entropy with application in coding theory ⋮ Is Huffmann coding dead? ⋮ Big data naturally rescaled ⋮ Huffman coding with non-sorted frequencies ⋮ LRM-trees: compressed indices, adaptive sorting, and compressed permutations ⋮ A note on the construction of error detecting/correcting prefix codes ⋮ Minimax trees in linear time with applications ⋮ A complementary view on the growth of directory trees ⋮ Development of two new mean codeword lengths ⋮ Arithmetic coding as a non-linear dynamical system ⋮ Joint compression and encryption using chaotically mutated Huffman trees ⋮ Alphabetic coding with exponential costs ⋮ Lempel-Ziv-78 compressed string dictionaries ⋮ Finite-state independence ⋮ Geometric compression of a quadrilateral mesh ⋮ Compressed depth sequences ⋮ Binary search with delayed and missing answers ⋮ Hydrozip: how hydrological knowledge can be used to improve compression of hydrological data ⋮ Decision problems under uncertainty based on entropy functionals ⋮ The $S$-digraph optimization problem and the greedy algorithm ⋮ An extension of Khrapchenko's theorem ⋮ XML compression techniques: A survey and comparison ⋮ Huffman codes and maximizing properties of Fibonacci numbers ⋮ A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance ⋮ Optimal representation in average using Kolmogorov complexity ⋮ On the construction of prefix-free and fix-free codes with specified codeword compositions ⋮ Regular expression searching on compressed text ⋮ Approximate string matching on Ziv--Lempel compressed text ⋮ Optimal binary trees with order constraints ⋮ Lossless image compression based on multiple-tables arithmetic coding ⋮ A review on the application of fuzzy transform in data and image compression ⋮ Synchronizing codewords of $q$-ary Huffman codes ⋮ Neural associative memory for brain modeling and information retrieval ⋮ New bounds on $D$-ary optimal codes ⋮ On the balanced minimum evolution polytope ⋮ Compressing probability distributions ⋮ A space-efficient Huffman decoding algorithm and its parallelism ⋮ Text compression methods ⋮ Huffman algebras for independent random variables ⋮ Worst-case analysis of the iterated longest fragment algorithm ⋮ An efficient decoding technique for Huffman codes ⋮ Protocols for asymmetric communication channels ⋮ A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs ⋮ Time series compression based on reinforcement learning ⋮ Lightweight compression with encryption based on asymmetric numeral systems ⋮ Variability as a better characterization of Shannon entropy ⋮ Optimal Sets of Questions for Twenty Questions ⋮ The cut operation in subclasses of convex languages ⋮ Protein Sequence Comparison Method Based on 3-ary Huffman Coding ⋮ An Introduction to Neural Data Compression ⋮ Hardness of \textsc{Balanced Mobiles} ⋮ Enhanced ternary Fibonacci codes ⋮ The work of Mark Braverman ⋮ Communication and information complexity ⋮ Bitmaps and filters for attribute-oriented searches ⋮ Algorithms ⋮ Unnamed Item ⋮ Adaptive arithmetic coding using fuzzy reasoning and grey prediction ⋮ Optimal binary search trees ⋮ A combinatorial approach to Golomb forests ⋮ On the importance of error resilience in visual communications over noisy channels ⋮ Generating probabilities with a specified entropy ⋮ Efficient and compact representations of some non-canonical prefix-free codes ⋮ Forward looking Huffman coding ⋮ Generalizations of Code Languages with Marginal Errors ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness ⋮ Image coding based on maximum entropy partitioning for identifying improbable intensities related to facial expressions ⋮ Set Orderings Requiring Costliest Alphabetic Binary Trees ⋮ The F-transform preprocessing for JPEG strong compression of high-resolution images ⋮ Pass-efficient methods for compression of high-dimensional turbulent flow data ⋮ Block Huffman coding ⋮ On the maximum length of Huffman codes ⋮ The design and implementation of the Gecko NFS Web proxy ⋮ Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ Optimal Skeleton Huffman Trees Revisited ⋮ Lossless compression and information hiding in images ⋮ Generalizations of Code Languages with Marginal Errors ⋮ (R, S)-Norm Information Measure and A Relation Between Coding and Questionnaire Theory ⋮ In-place calculation of minimum-redundancy codes ⋮ ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS ⋮ Optimal detection of a counterfeit coin with multi-arms balances ⋮ Worst-Case Optimal Adaptive Prefix Coding ⋮ A new weighted $(\alpha, \beta)$-norm information measure with application in coding theory ⋮ A fast algorithm for adaptive prefix coding ⋮ Parallel construction of binary trees with near optimal weighted path length ⋮ Finite state models for perception ⋮ Grammar compressed sequences with rank/select support ⋮ The topology of language ⋮ The cut operation in subclasses of convex languages (extended abstract) ⋮ Optimal synchronous coding ⋮ Weighted forward looking adaptive coding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximation Algorithms for Key Management in Secure Multicast ⋮ Robust universal complete codes for transmission and compression ⋮ More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding ⋮ Information dynamics at a phase transition ⋮ Fuzzy concept lattice reduction using Shannon entropy and Huffman coding ⋮ Context adaptive residual coding for efficient compression of MCEEG employing wave atom transforms ⋮ A generalization of circulant Hadamard and conference matrices ⋮ Practical Wavelet Tree Construction ⋮ Color image steganography scheme using gray invariant in AMBTC compression domain ⋮ On the stability of citation networks ⋮ Effective Dimensions and Relative Frequencies ⋮ ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES ⋮ Bidirectional adaptive compression ⋮ Using compressed suffix-arrays for a compact representation of temporal-graphs ⋮ Discrete Wavelet Compression of ERBS ⋮ A new protocol for the detection of node replication attacks in mobile wireless sensor networks ⋮ On the optimality of a simple prefix code ⋮ Constructions for variable-length error-correcting codes ⋮ Grafting key trees: efficient key management for overlapping groups ⋮ Wavelet trees for all ⋮ Online binary minimax trees ⋮ Efficient Associative Computation with Discrete Synapses ⋮ Optimal skeleton and reduced Huffman trees ⋮ Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes ⋮ Prefix codes: Equiprobable words, unequal letter costs ⋮ Complexity Questions in Non-Uniform Random Variate Generation ⋮ De Novo NGS Data Compression ⋮ Optimal Skeleton Huffman Trees ⋮ A simpler analysis of Burrows-Wheeler-based compression ⋮ Compressing table data with column dependency ⋮ LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Investigation of block-sorting of multiset permutations ⋮ HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT ⋮ L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order ⋮ Enumerating vertices of the balanced minimum evolution polytope ⋮ On the relation between the maximum entropy principle and the principle of least effort ⋮ A fast and efficient nearly-optimal adaptive Fano coding scheme ⋮ Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires ⋮ Unnamed Item ⋮ Optimal prefix codes with fewer distinct codeword lengths are faster to construct ⋮ Link-Level Aspects ⋮ Sterrett procedure for the generalized group testing problem ⋮ The Vcodex Platform for Data Compression ⋮ Unnamed Item ⋮ Generalized Huffman coding for binary trees with choosable edge lengths ⋮ Accelerated partial decoding in wavelet trees ⋮ Efficient quantum secure direct communication protocol based on quantum channel compression ⋮ Mining Compressing Sequential Patterns ⋮ Compact structure for sparse undirected graphs based on a clique graph partition ⋮ The design and implementation of a scheme for large ordered indices ⋮ The order of merging operations for queries in inverted file systems ⋮ Joint image compression-encryption scheme using entropy coding and compressive sensing ⋮ Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools ⋮ Reflections on Optimal and Nearly Optimal Binary Search Trees ⋮ Optimal Prefix Codes And Huffman Codes ⋮ Image compression with anisotropic diffusion ⋮ A note on growing binary trees ⋮ Bounds on the weighted path length of binary trees ⋮ Entropy-based Optimal Group-testing Procedures ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ The cost of a class of optimal binary trees ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness ⋮ A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes ⋮ Space-efficient Huffman codes revisited ⋮ Compror: On-line lossless data compression with a factor oracle. ⋮ Improved bounds for asymmetric communication protocols. ⋮ Unnamed Item ⋮ Optimum extensions of prefix codes. ⋮ Identification for Sources ⋮ Identification Entropy ⋮ New compression schemes for natural number sequences ⋮ On Undetected Redundancy in the Burrows-Wheeler Transform