495 search results - page 1 / 99 » Capacity of Non-Malleable Codes |
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
WIOPT
2010
IEEE
13 years 3 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
TIT
2010
12 years 11 months ago
2010
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...