Redundancy of Lossless Data Compression for Known Sources by Analytic Methods

DOI10.1561/0100000090zbMath1391.94627OpenAlexW4297970758MaRDI QIDQ4593745

Michael Drmota, Wojciech Szpankowski

Publication date: 22 November 2017

Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/36d0cab3af614bcfd938b6b4d45f0b19cf6fd905

zbMATH Keywords

lossless data compressioncode redundancyBoncelet codeShannon code, Huffman code

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)

This page was built for publication: Redundancy of Lossless Data Compression for Known Sources by Analytic Methods