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.

Total
0
Shares
Leave a Reply

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

×
As a Guest, you have insight(s) remaining for this month. Create a free account to view 300 more annually.
Related Posts
error: Faculti Content is protected. Please check our Privacy Policy and Terms and Conditions.

Add the Faculti Web App to your Mobile or Desktop homescreen

Install
×