Search results
From MaRDI portal
- Paper On-line adaptive canonical prefix coding with bounded compression loss 2002-08-04 Paper Housekeeping for prefix coding 2001-12-02 Paper https://portal...10 bytes (14 words) - 09:31, 6 October 2023
- for prefix coding 2001-12-02 Paper https://portal.mardi4nfdi.de/entity/Q2729858 2001-10-04 Paper Efficient construction of minimum-redundancy codes for...10 bytes (13 words) - 09:31, 6 October 2023
- 1999-04-28 Paper Efficient prefix coding of uncertainty spaces 1996-05-21 Paper Examples of probabilistic semantics of the basic coding theorem for uncertainty...10 bytes (15 words) - 14:09, 24 September 2023
- A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding 2019-05-06 Paper Prefix codes: Equiprobable words, unequal letter costs 2019-04-29...10 bytes (17 words) - 01:09, 9 December 2023
- 2022-07-18 Paper Prefix-Free Parsing for Building Big BWTs 2022-07-18 Paper Efficient and compact representations of some non-canonical prefix-free codes 2022-02-21...10 bytes (13 words) - 09:41, 6 October 2023
- 2018-10-16 Paper Coding and strong coding in trace monoids 2017-12-04 Paper Specular sets 2017-06-15 Paper On the decomposition of prefix codes 2017-03-16 Paper...10 bytes (17 words) - 18:26, 9 December 2023
- Network Coding 2017-04-28 Paper Achievable Rate Regions for Network Coding 2017-04-28 Paper Network Coding Capacity With a Constrained Number of Coding Nodes...10 bytes (13 words) - 12:12, 24 September 2023
- Publication Type A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding 2019-05-06 Paper Maximizing expected utility over a knapsack constraint...10 bytes (13 words) - 03:05, 7 October 2023
- Paper Efficient and compact representations of some non-canonical prefix-free codes 2022-02-21 Paper Using compressed suffix-arrays for a compact representation...10 bytes (13 words) - 20:01, 24 September 2023
- for Generalized Huffman Codes 2017-07-27 Paper Alphabetic coding with exponential costs 2010-09-02 Paper Optimal Prefix Codes for Infinite Alphabets With...10 bytes (15 words) - 05:44, 13 December 2023
- fairness in delay-based TCP over large networks 2015-11-20 Paper Structured prefix codes for quantized low-shape-parameter generalized Gaussian sources 1999-11-21...10 bytes (13 words) - 03:01, 7 October 2023
- of Kraft–McMillan inequality and its converse for prefix-free codes 2015-05-20 Paper Arithmetic coding as a non-linear dynamical system 2012-10-19 Paper...10 bytes (13 words) - 08:56, 6 October 2023
- 1997-08-12 Paper Any lifting of a trace coding is a word coding 1997-04-29 Paper On some decision problems for trace codings 1997-02-28 Paper Automata and numeration...10 bytes (13 words) - 06:37, 9 December 2023
- Paper Efficient and compact representations of some non-canonical prefix-free codes 2022-02-21 Paper Lightweight BWT and LCP Merging via the Gap Algorithm...10 bytes (13 words) - 03:51, 9 December 2023
- Paper The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding 2020-01-28 Paper On Secure Exact-Repair Regenerating Codes With a Single Pareto...10 bytes (17 words) - 20:13, 24 September 2023
- between the excess-code-length exponent and the excess-distortion exponent in lossy source coding 2002-08-04 Paper On limited-delay lossy coding and filtering...10 bytes (14 words) - 12:23, 6 October 2023
- Output Constrained Lossy Source Coding With Limited Common Randomness 2017-04-28 Paper Randomized Quantization and Source Coding With Constrained Output Distribution...10 bytes (15 words) - 21:35, 8 December 2023
- Compact Prefix Codes 2010-01-28 Paper Data Structures for Approximate Orthogonal Range Counting 2009-12-17 Paper Worst-Case Optimal Adaptive Prefix Coding...10 bytes (15 words) - 01:35, 25 September 2023
- scanning techniques for lossless image coding 2001-06-10 Paper Quantization 1999-11-21 Paper Simplistic universal coding 1999-05-26 Paper Asymptotic distribution...10 bytes (15 words) - 07:19, 13 December 2023
- of guessing prefix codes 1997-10-13 Paper Robust universal complete codes for transmission and compression 1996-07-07 Paper Is Huffmann coding dead? 1993-12-20...10 bytes (15 words) - 21:42, 10 December 2023
