SOFSEM
2010
Springer
13 years 2 months ago
2010
Springer
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We consider asynchronous communication over point-to-point discrete memoryless channels without feedback. The transmitter starts sending one block codeword at an instant that is u...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract-- In this paper, a downlink scenario in which a singleantenna base station communicates with K single antenna users, over a time-correlated fading channel, is considered. ...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...