Capacity Upper Bounds for Deletion-Type Channels

Recommend Faculti to your resource manager

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

Log-in or Sign-up to Faculti
Currently viewing this subject insight as a guest. You have insight(s) remaining for this month.

Leave a Reply

Your email address will not be published.

Copyright © Faculti Media Limited 2013 - 2024. All rights reserved.
error: