Pages that link to "Item:Q5510070"

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

Displaying 37 items.

• More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)
• (Q5618312) (← links)
• Bitmaps and filters for attribute-oriented searches (Q5679750) (← links)
• Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)
• Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness (Q5868171) (← links)
• Algorithms (Q5905704) (← links)
• Optimal binary search trees (Q5906917) (← links)
• Forward looking Huffman coding (Q5918359) (← links)
• Efficient and compact representations of some non-canonical prefix-free codes (Q5918490) (← links)
• Adaptive arithmetic coding using fuzzy reasoning and grey prediction (Q5938746) (← links)
• A combinatorial approach to Golomb forests (Q5941521) (← links)
• On the importance of error resilience in visual communications over noisy channels (Q5950277) (← links)
• Generating probabilities with a specified entropy (Q5950720) (← links)
• A Systematic Approach and Analysis of Key Mismatch Attacks on Lattice-Based NIST Candidate KEMs (Q6041281) (← links)
• Time series compression based on reinforcement learning (Q6052621) (← links)
• Lightweight compression with encryption based on asymmetric numeral systems (Q6100062) (← links)
• Variability as a better characterization of Shannon entropy (Q6108033) (← links)
• Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
• Optimal Sets of Questions for Twenty Questions (Q6141868) (← links)
• The cut operation in subclasses of convex languages (Q6165559) (← links)
• Protein Sequence Comparison Method Based on 3-ary Huffman Coding (Q6167647) (← links)
• An Introduction to Neural Data Compression (Q6180224) (← links)
• The work of Mark Braverman (Q6200321) (← links)
• Communication and information complexity (Q6200329) (← links)
• A fast and space-economical algorithm for length-limited coding (Q6487940) (← links)
• Natural-Language Text Compression Using Reverse Multi-Delimiter Codes (Q6495168) (← links)
• Lossless text compression by means of binary-coded ternary number representation (Q6495256) (← links)
• Joint optimization-encryption model based on auto encoder neural network, variable-length dynamic S-box and new stream encryption (Q6537551) (← links)
• Evaluating regular path queries on compressed adjacency matrices (Q6545410) (← links)
• Binary mixed-digit data compression codes (Q6545448) (← links)
• Optimum alphabetic binary trees (Q6567684) (← links)
• Conjectures on optimal nested generalized group testing algorithm (Q6578162) (← links)
• Community detection in complex networks: from statistical foundations to data science applications (Q6602352) (← links)
• Increasing returns and the efficient acquisition of information (Q6604753) (← links)
• Selective dynamic compression (Q6611047) (← links)
• Synchronizing dynamic Huffman codes (Q6611048) (← links)
• Dense non-binary Fibonacci codes (Q6660001) (← links)