scientific article; zbMATH DE number 6683480

MaRDI QIDQ2959853zbMATH OpenFDO

Authors Wojciech Szpankowski

Publication date 10 February 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAI0102

zbMATH Keywords

complex asymptoticsdata compressiondistribution modulo 1Huffman codeKhodak codeKraft's inequalityMellin transformprefix codesredundancyShannon lower boundsource codingTunstall code

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• The redundancy of source coding with a fidelity criterion. 1. Known statistics
• Average Redundancy of the Shannon Code for Markov Sources
• Asymptotic average redundancy of Huffman (and other) block codes
• On the average redundancy rate of the Lempel-Ziv code
• Relative-redundancy universal coding of memoryless sources
• Methods of constructing lower bounds for redundancy of universal coding
• The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
• Bounding the Average Length of Optimal Source Codes Via Majorization Theory
• Tree approximation and optimal encoding
• On the redundancy of trellis lossy source coding

Cited in

(6)

• On asymptotics of certain recurrences arising in universal coding
• Code and parse trees for lossless source encoding
• Canonical trees, compact prefix-free codes, and sums of unit fractions: a probabilistic analysis
• scientific article; zbMATH DE number 2086237 (Why is no real title available?)
• Average Redundancy of the Shannon Code for Markov Sources
• Renewal theory in the analysis of tries and strings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959853)