Pages that link to "Item:Q5510070"

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

Displaying 50 items.

• A note on the construction of error detecting/correcting prefix codes (Q963391) (← links)
• A complementary view on the growth of directory trees (Q977789) (← links)
• Alphabetic coding with exponential costs (Q990132) (← links)
• Geometric compression of a quadrilateral mesh (Q1004851) (← links)
• Compressed depth sequences (Q1006078) (← links)
• Binary search with delayed and missing answers (Q1007537) (← links)
• The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
• XML compression techniques: A survey and comparison (Q1021579) (← links)
• Lossless image compression based on multiple-tables arithmetic coding (Q1036264) (← links)
• Neural associative memory for brain modeling and information retrieval (Q1044686) (← links)
• New bounds on \(D\)-ary optimal codes (Q1044733) (← links)
• Compressing probability distributions (Q1045918) (← links)
• A short note on the redundancy of degree \(\alpha\) (Q1084075) (← links)
• Mathematical optimization and the synchronizing properties of encodings (Q1101414) (← links)
• On finding minimal length superstrings (Q1140992) (← links)
• Best Huffman trees (Q1160111) (← links)
• Huffman's algorithm via algebra (Q1168073) (← links)
• Testing the optimality of alphabetic trees (Q1186607) (← links)
• Data compression with factor automata (Q1190467) (← links)
• Decision problems under uncertainty based on entropy functionals (Q1262187) (← links)
• A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance (Q1270819) (← links)
• Optimal representation in average using Kolmogorov complexity (Q1276258) (← links)
• Optimal binary trees with order constraints (Q1283811) (← links)
• Synchronizing codewords of \(q\)-ary Huffman codes (Q1292868) (← links)
• Huffman algebras for independent random variables (Q1314848) (← links)
• Dynamic programming and graph optimization problems (Q1327180) (← links)
• On polychotomous search problems (Q1330533) (← links)
• Complexity aspects of guessing prefix codes (Q1336967) (← links)
• Search problems: One, two or many rounds (Q1344611) (← links)
• Complete variable-length ``fix-free'' codes (Q1345134) (← links)
• On the redundancy achieved by Huffman codes (Q1364502) (← links)
• The discovery of algorithmic probability (Q1370859) (← links)
• Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← links)
• A space-efficient Huffman decoding algorithm and its parallelism (Q1583590) (← links)
• Worst-case analysis of the iterated longest fragment algorithm (Q1603464) (← links)
• An efficient decoding technique for Huffman codes (Q1603588) (← links)
• Protocols for asymmetric communication channels (Q1604209) (← links)
• A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding (Q1619805) (← links)
• Operations research applications of dichotomous search (Q1681128) (← links)
• On partial state matching (Q1682284) (← links)
• Random walks and diffusion on networks (Q1687598) (← links)
• Detecting life signatures with RNA sequence similarity measures (Q1717070) (← links)
• Maximizing Wiener index for trees with given vertex weight and degree sequences (Q1740236) (← links)
• A joint representation of Rényi's and Tsalli's entropy with application in coding theory (Q1751509) (← links)
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
• Minimax trees in linear time with applications (Q1761500) (← links)
• Finite-state independence (Q1787949) (← links)
• Huffman codes and maximizing properties of Fibonacci numbers (Q1816132) (← links)
• Regular expression searching on compressed text (Q1827268) (← links)
• Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)