文章基本信息

标题：Efficiently Decodable Codes for the Binary Deletion Channel
本地全文：下载
作者：Venkatesan Guruswami ; Ray Li
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：81
页码：47:1-47:13
DOI：10.4230/LIPIcs.APPROX-RANDOM.2017.47
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Coding theory; Combinatorics; Synchronization errors; Channel capacity