33 search results - page 6 / 7 » A Coding Theorem for a Class of Stationary Channels with Fee... |
TIT
2010
13 years 2 months ago
2010
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— ABBA codes are an important class of quasiorthogonal space-time block codes proposed by Tirkkonen et al.. Recently, they have become more attractive for practical appli...
SIGCOMM
1998
ACM
13 years 11 months ago
1998
ACM
—The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Inspired by the context of compressing encrypted sources, this paper considers the general tradeoff between rate, end-to-end delay, and probability of error for lossless source co...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...