495 search results - page 11 / 99 » Capacity of Non-Malleable Codes |
ICC
2009
IEEE
13 years 6 months ago
2009
IEEE
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper we attempt to further demonstrate connections between information theory and control, in a networked setting. Specifically, we consider the communication problem of b...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
— For an nt transmit, nr receive antenna system (nt × nr system), a full-rate space time block code (STBC) transmits nmin = min(nt, nr) complex symbols per channel use and in ge...