Capacity Upper Bounds for Deletion-Type Channels
content
Imperial College London
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.
Topic Overview
More DetailAsk the video a question: Explore the transcript or get definitions
Loading...
Related Videos
Goldsmiths University of London
Experience Driven Design of Creative Systems
Goldsmiths University of London
Constructionist Learning for Student Coders
Uncategorized
Data-driven Learning in an Incremental Grammar Framework
