Capacity Upper Bounds for Deletion-Type Channels

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 the interviewee


Report Infringement

Sign-up

Leave a Reply

Your email address will not be published. Required fields are marked *

Previous Article

Socio-scientific issue-based learning

Next Article

Copyright, trolling and speculative invoicing in the shadow of the law

×
As a Guest, you have insight(s) remaining for this month. Create a free account to view 300 more annually.
Related Posts
error:

Add the Faculti Web App to your Mobile or Desktop homescreen

Install
×