Capacity Upper Bounds for Deletion-type Channels

DOI10.1145/3281275zbMath1471.94018OpenAlexW2923015260WikidataQ128184669 ScholiaQ128184669MaRDI QIDQ5244382

Mahdi Cheraghchi

Publication date: 21 November 2019

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3281275

zbMATH Keywords

information theoryerror-correcting codeschannel coding

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Convex programming (90C25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Information-Theoretic Foundations of DNA Data Storage

This page was built for publication: Capacity Upper Bounds for Deletion-type Channels