2 search results - page 1 / 1 » Beating the Gilbert-Varshamov Bound for Online Channels |
CORR
2011
Springer
12 years 12 months ago
2011
Springer
In the online channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x1, . . . , xn) ∈ {0, 1}n bit by bit via a channel lim...
TIT
1998
13 years 4 months ago
1998
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...