In classical information theory it is well-known that feedback does not improve the channel capacity. We demonstrate that this is not the case in the interactive setting by developing a new coding scheme for interactive communication over the binary symmetric channel (BSC) with feedback that allows recovery of the original communication with vanishing probability of error. More precisely, we sh...

We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and channel capacity. The decoding complexity grows linearly with code length.

This paper highlights security issues that can arise when incorrect assumptions are made on the capabilities of an eavesdropper. In particular, we analyze a channel model based on a split Binary Symmetric Channel (BSC). Corresponding security parameters are chosen based on this channel model, and assumptions on the eavesdroppers capabilities. A gradual relaxation of the restrictions on the eave...

We explore the capacity and generalized degrees of freedom of the two-user Gaussian X channel, i.e. a generalization of the 2 user interference channel where there is an independent message from each transmitter to each receiver. There are three main results in this paper. First, we characterize the sum capacity of the deterministic X channel model under a symmetric setting. Second, we characte...

The generalized degrees of freedom (GDoF) of the two user symmetric multiple input multiple output (MIMO) interference channel (IC) are characterized as a function of the channel strength levels and the level of channel state information at the transmitters (CSIT). In this symmetric setting, each transmitter is equipped with M antennas, each receiver is equipped with N antennas, and both cross ...

we investigate buchbaum and eisenbud's construction of the second symmetric power $s_r(x)$ of a chain complex $x$ of modules over a commutative ring $r$. we state and prove a number of results from the folklore of the subject for which we know of no good direct references. we also provide several explicit computations and examples. we use this construction to prove the following ...

A general capacity formula C = sup X I(X; Y), which is correct for arbitrary single-user channels without feedback, is introduced in this tutorial. This new capacity formula is obtained by using a general channel model without any assumptions of the channel, introducing the notion of inf/sup-information/entropy rates, and finding a new tight converse bound on the error probability. In Section 1...

This Paper is containing the different types of Channel Coding which is used in multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM). To increase the efficiency of MIMO-OFDM there are several channel coding are applied in it.in this paper the aim is to show the discussion about all channel coding which are used as well as using in MIMO-OFDM system. This paper is...

Computational fluid dynamics (CFD) simulations were performed for four 10 cm2 serpentine flow-fields with single channel, double channel, cyclic-single channel, and symmetric-single channel patterns to investigate the effect of flow-field design. High and low inlet humidity operating conditions were studied by calculating the distributions of overpotentials, current density distribution, and me...