Skip to search formSkip to main contentSkip to account menu

Deletion channel

A deletion channel is a communications channel model used in coding theory and information theory. In this model, a transmitter sends a bit (a zero… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Binary erasure channelChannel capacityCoding theoryInformation theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Beyond Trace Reconstruction: Population Recovery from the Deletion Channel
Population recovery is the problem of learning an unknown distribution over an unknown set of n-bit strings, given access to… 
2019
2019
Polar Codes for the Deletion Channel: Weak and Strong Polarization
This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden… 
2017
2017
Capacity upper bounds for deletion-type channels
We develop a systematic approach, based on convex programming and real analysis, for obtaining upper bounds on the capacity of… 
Highly Cited
2010
Highly Cited
2010
Tight asymptotic bounds for the deletion channel with small deletion probabilities
In this paper, we consider the capacity C of the binary deletion channel for the limiting case where the deletion probability p… 
Highly Cited
2008
Highly Cited
2008
Novel Bounds on the Capacity of the Binary Deletion Channel
We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds… 
Highly Cited
2007
Highly Cited
2007
Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
This paper considers the capacity of binary deletion channels, where bits are deleted independently with probability d. It… 
Highly Cited
2006
Highly Cited
2006
A Simple Lower Bound for the Capacity of the Deletion Channel
We present a simple proof that the capacity of the binary independent and identically distributed (i.i.d.) deletion channel… 
2004
2004
Insertion/deletion channels: reduced-state lower bounds on channel capacities
We use Monte-Carlo methods to compute lower bounds on information rates of insertion/deletion channels. The information rate… 
2003
2003
Map detection in noisy channels with synchronization errors (including the insertion/deletion channel)
In this paper, we consider the problem of mini- mizing the symbol error probability when detecting a sequence of symbols… 
2003
2003
Concatenated codes for deletion channels
We design concatenated codes suitable for the deletion channel. The inner code is a com- bination of a single deletion correcting… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)