2016/01/31 by Zitan Chen, Sidharth Jaggi, Chen, Zitan +3
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1602.00276
openalex publication_date 2016/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the q-ary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x =(x1,…,xn) ∈ \0,1,…,q-1\n symbol by symbol via a channel limited to at most pn errors and/or p* n erasures. The channel is "online" in the sense that at the ith step of communication the channel decides whether to corrupt the ith symbol or not based on its view so far, i.e., its decision depends only on the transmitted symbols (x1,…,xi). This is in contrast to the classical adversarial channel in which the corruption is chosen by a channel that has a full knowledge on the sent codeword x. In this work we study the capacity of q-ary online channels for a combined corruption model, in which the channel may impose at most pn \em errors and at most p* n \em erasures on the transmitted codeword. The online channel (in both the error and erasure case) has seen a number of recent studies which present both upper and lower bounds on its capacity. In this work, we give a full characterization of the capacity as a function of q,p, and p*.