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.
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
Optimal coding for the deletion channel with small deletion probability
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are… 
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
Using variable-length codes to correct Insertion, Deletion and substitution errors
A maximum likelihood metric is derived for the decoding of variable-length codes over a Binary Substitution, Insertion and… 
2010
2010
A new bound for the capacity of the deletion channel with high deletion probabilities
Let $C(d)$ be the capacity of the binary deletion channel with deletion probability $d$. It was proved by Drinea and Mitzenmacher… 
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
Novel bounds on the capacity of binary channels with deletions and substitutions
We present novel bounds on the capacity of binary channels with independent and identically distributed deletions and… 
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)