62 search results - page 10 / 13 » Improved Upper Bound for the Redundancy of Fix-Free Codes |
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
—In recent literature, network coding has emerged as a promising information theoretic approach to improve the performance of both peer-to-peer and wireless networks. It has been...
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
TIT
2008
14 years 11 months ago
2008
Abstract--For output-symmetric discrete memoryless channels (DMCs) at even moderately high rates, fixed-block-length communication systems show no improvements in their error expon...
149
click to vote
SPAA
1993
ACM
15 years 3 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...