Repeated Communication and Ramsey Graphs (1995)
| Venue: | IEEE Transactions on Information Theory |
| Citations: | 24 - 13 self |
BibTeX
@ARTICLE{Alon95repeatedcommunication,
author = {Noga Alon and Alon Orlitsky},
title = {Repeated Communication and Ramsey Graphs},
journal = {IEEE Transactions on Information Theory},
year = {1995},
volume = {41},
pages = {1276--1289}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
e study the savings afforded by repeated use in two zero-error communication problems. e show that for some random sources, communicating one instance requires arbitrarily-many bits, but communicating multiple instances requires roughly one bit per instance. We also exhibit sources where the number of bits required for a single instance is comparable to the source's size, but two instances require only a logarithmic number of additional bits. We relate this problem to that of communicating information over a channel. Known results imply that some channels can communicate exponentially more bits in two uses than they can in one use.
