Ramsey Theory and Repeated Communication Complexity (Review)


We summarize the 1995 paper of Alon and Orlitsky, “Repeated Communication and Ramsey Graphs” [1], in which the authors characterize the capacity of channels with adversarial noise which is unbounded in the amount of noise, but rather in the type of noise. A second problem they address is dual-source coding, in which the task is to minimize the amount of… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics