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...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
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...
—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...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
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...