Publication

Capacity upper bounds for the deletion channel

2007
Conference Papers

Abstract

We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as d goes to 1. These appear to be the first non-trivial upper bounds for this probabilistic deletion channel.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Capacity upper bounds for the deletion channel

Chat with Graph Search

Majorana diagrammatics for quantum spin-1/2 models

Recycling History: Efficient Recommendations from Contextual Dueling Bandits

Randomized Low-Rank Approximation for Time- and Parameter-Dependent Problems