Capacity Upper Bounds for Deletion-Type Channels

Embed Cite Participate

Mahdi Cheraghchi discusses the systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of the binary deletion channel and, more generally, channels with i.i.d. insertions and deletions.

Image courtesy of interviewee

Leave a Reply

Your email address will not be published.

×
Log-in or Sign-up to Faculti
Currently viewing as guest. You have insight(s) remaining for this month.
Copyright © Faculti Media Limited 2023. All rights reserved.
Recommend Faculti to your librarian

error: