A Method for the Construction of Minimum-Redundancy Codes
From MaRDI portal
Publication:5510070
DOI10.1109/JRPROC.1952.273898zbMath0137.13605WikidataQ54105217 ScholiaQ54105217MaRDI QIDQ5510070
Publication date: 1952
Published in: Proceedings of the IRE (Search for Journal in Brave)
94B25: Combinatorial codes
Related Items
Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires, Optimal Prefix Codes And Huffman Codes, Investigation of block-sorting of multiset permutations, The design and implementation of the Gecko NFS Web proxy, Optimal synchronous coding, Approximation Algorithms for Key Management in Secure Multicast, More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding, Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes, Unnamed Item, Bitmaps and filters for attribute-oriented searches, Algorithms, Optimal binary search trees, Parallel lossless image compression using Huffman and arithmetic coding, Algorithmic information and simplicity in statistical physics, Is Huffmann coding dead?, An extension of Khrapchenko's theorem, Text compression methods, Proof pearl: Mechanizing the textbook proof of Huffman's algorithm, Dynamic Shannon coding, 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, Practical and flexible pattern matching over Ziv-Lempel compressed text., New optimization models for designing synchronizing codes, Trees with exponentially growing costs, An adaptive character wordlength algorithm for data compression, Weighted height of random trees, A novel lossless data compression scheme based on the error correcting Hamming codes, A note on the construction of error detecting/correcting prefix codes, A complementary view on the growth of directory trees, Alphabetic coding with exponential costs, 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 \(\alpha\), 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, 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, On the maximum length of Huffman codes, A fast algorithm for adaptive prefix coding, Finite state models for perception, 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, A note on growing binary trees, Bounds on the weighted path length of binary trees, Optimum extensions of prefix codes., The topology of language, Unnamed Item, HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT, Worst-Case Optimal Adaptive Prefix Coding, Entropy-based Optimal Group-testing Procedures, Identification for Sources, Identification Entropy, Effective Dimensions and Relative Frequencies, The Vcodex Platform for Data Compression, Reflections on Optimal and Nearly Optimal Binary Search Trees, The design and implementation of a scheme for large ordered indices, The order of merging operations for queries in inverted file systems, Set Orderings Requiring Costliest Alphabetic Binary Trees, Unnamed Item, On the optimality of a simple prefix code, Adaptive arithmetic coding using fuzzy reasoning and grey prediction, A combinatorial approach to Golomb forests, On the importance of error resilience in visual communications over noisy channels, Generating probabilities with a specified entropy
