We propose to construct a joint channel-network coding (knosswn as Random Linear Coding) scheme based on improved turbo codes for the distributed storage in wireless communication network with k data nodes, s storage nodes (k<s) and a data collector. This framework extends the classical distributed storage with erasure channel to AWGN and fading channel scenario. We investigate the throughput p...

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity CS , which is usually smaller than the channel capacity C. In order to remove the loss C−CS , we propose a multiplex coding scheme with plural independent messages. In this paper, it is shown that the proposed multipl...

Given a general channel b over which the uniform X source, denoted by U , is directly communicated within distortion D. The source U puts uniform distribution on all sequences with type precisely pX as compared with the i.i.d. X source which puts ‘most of’ its mass on sequences with type ‘close to’ pX . A randomized covering-packing duality is established between source-coding and channel-codin...

Distributed video coding is a new video coding paradigm aimed at shifting the computational expensive motion estimation to the decoder. Side information is generated at the decoder as a prediction of the current frame. This creates a virtual dependency channel between the source video at the encoder and the side information at the decoder. Error correcting channel codes are used to correct the ...

This is an exposition of two important theorems of information theory often singularly referred to as The Noisy-Channel Coding Theorem. Given a few assumptions about a channel and a source, the coding theorem demonstrates that information can be communicated over a noisy channel at a non-zero rate approximating the channel’s capacity with an arbitrarily small probability of error. It originally...

This article surveys application of convex optimization theory to topics in Information Theory. Topics include optimal robust algorithms for hypothesis testing; a fresh look at the relationships between channel coding and robust hypothesis testing; and the structure of optimal input distributions in channel coding. A key finding is that the optimal distribution achieving channel capacity is typ...