词条 | 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 or a one), and the receiver either receives the bit (with probability ) or does not receive anything without being notified that the bit was dropped (with probability ). Determining the capacity of the deletion channel is an open problem.[1][2] The deletion channel should not be confused with the binary erasure channel which is much simpler to analyze. Formal descriptionLet be the deletion probability, . The iid binary deletion channel is defined as follows: Given a input sequence of bits as input, each bit in can be deleted with probability . The deletion positions are unknown to the sender and the receiver. The output sequence is the sequence of the which were not deleted, in the correct order and with no errors. Capacity{{unsolved|computer science|What is the capacity of a deletion channel?}}The capacity of the binary deletion channel (as an analytical expression of the deletion rate ) is unknown. It has a mathematical expression{{citation needed|date=January 2016}}. Several upper and lower bounds are known. External links
References1. ^{{citation | last = Mitzenmacher | first = Michael | authorlink = Michael Mitzenmacher | doi = 10.1214/08-PS141 | journal = Probability Surveys | mr = 2525669 | pages = 1–33 | title = A survey of results for deletion channels and related synchronization channels | volume = 6 | year = 2009}}. 2. ^{{citation | last1 = Kanoria | first1 = Yashodhan | last2 = Montanari | first2 = Andrea | doi = 10.1109/TIT.2013.2262020 | issue = 10 | journal = IEEE Transactions on Information Theory | mr = 3106824 | pages = 6192–6219 | title = Optimal coding for the binary deletion channel with small deletion probability | volume = 59 | year = 2013}}. 1 : Coding theory |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。