# Reference Request: Error correction code for a random projection

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.

• 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 Oct 7 '13 at 0:14