<p>I think the term is <a href="http://en.wikipedia.org/wiki/Deletion_channel">deletion channel</a>. As the Wikipedia article says, this "should not be confused with the binary erasure channel".</p>

CC BY-SA 3.0
2013-10-07T00:12:30.337Z
Yes, and a place to start could be Mitzenmacher's survey (2009): http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.1315
usul
CC BY-SA 3.0
2013-10-06T23:46:41.140Z
2013-10-06T23:46:41.140Z
Martin Leslie
<p>The term you're looking for is: Binary Erasure Channel. And here's the link: <a href="http://en.wikipedia.org/wiki/Binary_erasure_channel" rel="nofollow">Binary Erasure channel</a>.</p>

CC BY-SA 3.0
2013-10-07T00:14:43.593Z
In an erasure channel the erased bits appear as question marks, so for instance $10111$ could be corrupted to $10??1$, whereas for a deletion channel, the bits are removed entirely, so we would receive $101$.
usul
CC BY-SA 3.0
2013-10-06T23:35:57.527Z
2013-10-06T23:35:57.527Z
Sudarsan
<p>I'm interested in a variant of the Binary Channel, where the bits aren't <em>flipped</em> with some probability, but rather they are <em>completely erased</em>. Output words therefore vary in length.</p>

<p>I'm quite sure that this subject is well researched, and all I need is the correct search term.</p>

CC BY-SA 3.0
2013-10-06T18:05:16.693Z
sounds like some kind of edit distance metric. http://en.wikipedia.org/wiki/Levenshtein_distance
Turbo
<reference-request><it.information-theory><coding-theory>
Reference Request: Error correction code for a random projection
Shir
# Reference Request: Error correction code for a random projection

(Asked by: username_0 on 2013-10-06)

I'm interested in a variant of the Binary Channel, where the bits aren't *flipped* with some probability, but rather they are *completely erased*. Output words therefore vary in length.

I'm quite sure that this subject is well researched, and all I need is the correct search term.

**Tags:** reference-request, it.information-theory, coding-theory
> **Comments:**
> **username_1**: sounds like some kind of edit distance metric. http://en.wikipedia.org/wiki/Levenshtein_distance  

---

## 2 answers

### Answer by username_2 on 2013-10-06. Score: 5 | Accepted answer

I think the term is [deletion channel](http://en.wikipedia.org/wiki/Deletion_channel). As the Wikipedia article says, this "should not be confused with the binary erasure channel".

> **Comments:**
> **username_3**: Yes, and a place to start could be Mitzenmacher's survey (2009): http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.1315  

---

### Answer by username_4 on 2013-10-06. Score: -2

The term you're looking for is: Binary Erasure Channel. And here's the link: [Binary Erasure channel](http://en.wikipedia.org/wiki/Binary_erasure_channel).

> **Comments:**
> **username_3**: In an erasure channel the erased bits appear as question marks, so for instance $10111$ could be corrupted to $10??1$, whereas for a deletion channel, the bits are removed entirely, so we would receive $101$.  

---

