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 existence of codes of rate (1-p)/9, and thus bounded away from 0 for any p 0.