Variable-Length Source Dispersions Differ Under Maximum and Average Error Criteria

DOI10.1109/TIT.2020.3019062zbMath1457.94074arXiv1910.05724OpenAlexW3098890812MaRDI QIDQ5138917

Yuta Sakai, Vincent Y. F. Tan

Publication date: 4 December 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.05724

zbMATH Keywords

application to guessing problemsone-shot boundsoptimal average codeword lengthvariable-length compression without prefix-free constraints

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Related Items (2)

Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Slepian-Wolf coding with quantum side information

This page was built for publication: Variable-Length Source Dispersions Differ Under Maximum and Average Error Criteria