Research news, analysis and insights

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.

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

You have free insight(s) remaining for this month.
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