Pages that link to "Item:Q5510070"

The following pages link to A Method for the Construction of Minimum-Redundancy Codes (Q5510070):

Displaying 50 items.

• Bidirectional adaptive compression (Q2689643) (← links)
• Grafting key trees: efficient key management for overlapping groups (Q2697894) (← links)
• On asymmetric communication protocols (Q2741453) (← links)
• Construction of minimum bandwidth regenerating codes with combinatorial design (Q2825280) (← links)
• Randomized Group Testing Both Query-Optimal and Minimal Adaptive (Q2891370) (← links)
• Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts (Q2909199) (← links)
• LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT (Q3021972) (← links)
• (Q3143777) (← links)
• (Q3165665) (← links)
• Worst-Case Optimal Adaptive Prefix Coding (Q3183465) (← links)
• Complexity Questions in Non-Uniform Random Variate Generation (Q3298440) (← links)
• De Novo NGS Data Compression (Q3305522) (← links)
• Entropy-based Optimal Group-testing Procedures (Q3415862) (← links)
• Identification for Sources (Q3439229) (← links)
• Identification Entropy (Q3439242) (← links)
• Generalizations of Code Languages with Marginal Errors (Q3451108) (← links)
• Effective Dimensions and Relative Frequencies (Q3507438) (← links)
• The Vcodex Platform for Data Compression (Q3612878) (← links)
• Reflections on Optimal and Nearly Optimal Binary Search Trees (Q3644717) (← links)
• The design and implementation of a scheme for large ordered indices (Q3898039) (← links)
• The order of merging operations for queries in inverted file systems (Q3898044) (← links)
• Set Orderings Requiring Costliest Alphabetic Binary Trees (Q3964022) (← links)
• On the optimality of a simple prefix code (Q4053462) (← links)
• (Q4158957) (← links)
• Procédures optimales pour le classement des $t$ meilleurs articles parmi $n$ au moyen de comparaisons binaires (Q4401949) (← links)
• Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
• Fuzzy concept lattice reduction using Shannon entropy and Huffman coding (Q4586139) (← links)
• Constructions for variable-length error-correcting codes (Q4608523) (← links)
• Prefix codes: Equiprobable words, unequal letter costs (Q4632460) (← links)
• (Q4636990) (← links)
• Investigation of block-sorting of multiset permutations (Q4652742) (← links)
• Link-Level Aspects (Q4687411) (← links)
• The design and implementation of the Gecko NFS Web proxy (Q4791107) (← links)
• Optimal synchronous coding (Q4828660) (← links)
• L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order (Q4915229) (← links)
• Mining Compressing Sequential Patterns (Q4969924) (← links)
• Optimal Skeleton Huffman Trees Revisited (Q5042248) (← links)
• In-place calculation of minimum-redundancy codes (Q5057451) (← links)
• Practical Wavelet Tree Construction (Q5102058) (← links)
• Discrete Wavelet Compression of ERBS (Q5116377) (← links)
• On Undetected Redundancy in the Burrows-Wheeler Transform (Q5140764) (← links)
• Optimal Skeleton Huffman Trees (Q5150936) (← links)
• Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness (Q5250214) (← links)
• A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes (Q5251421) (← links)
• (<i>R, S</i>)-Norm Information Measure and A Relation Between Coding and Questionnaire Theory (Q5298329) (← links)
• Approximation Algorithms for Key Management in Secure Multicast (Q5323059) (← links)
• ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES (Q5358095) (← links)
• Efficient Associative Computation with Discrete Synapses (Q5380385) (← links)
• Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes (Q5386090) (← links)