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
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel
This work gives an explicit construction of a family of error correcting codes for the binary deletion channel and for the… 
2017
2017
Efficiently Decodable Codes for the Binary Deletion Channel
In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the… 
2016
2016
Efficient compression algorithm for file updates under random insertions and deletions
The problem of one-way file synchronization from the client to the data-center, namely, file updates, is studied. The problem is… 
2013
2013
An improvement of the deletion channel capacity upper bound
In this paper, we offer an alternative look at channels with deletion errors by considering equivalent models for deletion… 
2011
2011
On capacity and coding for segmented deletion channels
We consider binary deletion channels with a segmentation assumption which appears to be suited for more practical scenarios… 
2011
2011
Analytical Lower Bounds on the Capacity of Insertion and Deletion Channels
We develop several analytical lower bounds on the capacity of binary insertion and deletion channels by considering independent… 
2010
2010
Privacy Preserving Classification in Two-Dimension Distributed Data
Within the context of privacy preserving data mining, several solutions for privacy-preserving classification rules learning such… 
2009
2009
Upper Bounding the Deletion Channel Capacity by Auxiliary Memoryless Channels
We present two upper bounds on the capacity of the binary deletion channel. Both bounds are obtained by providing the transmitter… 
2006
2006
Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels
In this paper, we present a bidirectional Viterbi decoding algorithm using the Levenshtein distance metric for a regular… 
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… 
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)