Interactive Channel Capacity Revisited

We provide the first capacity approaching coding schemes that robustly simulate any interactive protocol over an adversarial channel that corrupts any $\epsilon$ fraction of the transmitted symbols. Our coding schemes achieve a communication rate of $1 - O(\sqrt{\epsilon \log \log 1/\epsilon})$ over any adversarial channel. This can be improved to $1 - O(\sqrt{\epsilon})$ for random, oblivious, and computationally bounded channels, or if parties have shared randomness unknown to the channel. Surprisingly, these rates exceed the $1 - \Omega(\sqrt{H(\epsilon)}) = 1 - \Omega(\sqrt{\epsilon \log 1/\epsilon})$ interactive channel capacity bound which [Kol and Raz; STOC'13] recently proved for random errors. We conjecture $1 - \Theta(\sqrt{\epsilon \log \log 1/\epsilon})$ and $1 - \Theta(\sqrt{\epsilon})$ to be the optimal rates for their respective settings and therefore to capture the interactive channel capacity for random and adversarial errors. In addition to being very communication efficient, our randomized coding schemes have multiple other advantages. They are computationally efficient, extremely natural, and significantly simpler than prior (non-capacity approaching) schemes. In particular, our protocols do not employ any coding but allow the original protocol to be performed as-is, interspersed only by short exchanges of hash values. When hash values do not match, the parties backtrack. Our approach is, as we feel, by far the simplest and most natural explanation for why and how robust interactive communication in a noisy environment is possible

Asynchronous multiple-access channel capacity

The capacity region for the discrete memoryless multiple-access channel without time synchronization at the transmitters and receivers is shown to be the same as the known capacity region for the ordinary multiple-access channel. The proof utilizes time sharing of two optimal codes for the ordinary multiple-access channel and uses maximum likelihood decoding over shifts of the hypothesized transmitter words

Remarks on entanglement assisted classical capacity

The property of the optimal signal ensembles of entanglement assisted channel capacity is studied. A relationship between entanglement assisted channel capacity and one-shot capacity of unassisted channel is obtained. The data processing inequalities, convexity and additivity of the entanglement assisted channel capacity are reformulated by simple methods.Comment: Revtex, 5 page

Pedestrians effects on indoor MIMO-OFDM channel capacity

Temporal variations caused by pedestrian movement can significantly affect the channel capacity of indoor MIMOOFDM wireless systems. This paper compares systematic measurements of MIMO-OFDM channel capacity in presence of pedestrians with predicted MIMO-OFDM channel capacity values using geometric optics-based ray tracing techniques. Capacity results are presented for a single room environment using 5.2 GHz with 2x2, 3x3 and 4x4 arrays as well as a 2.45 GHz narrowband 8x8 MIMO array. The analysis shows an increase of up to 2 b/s/Hz on instant channel capacity with up to 3 pedestrians. There is an increase of up to 1 b/s/Hz in the average capacity of the 4x4 MIMO-OFDM channel when the number of pedestrians goes from 1 to 3. Additionally, an increment of up to 2.5 b/s/Hz in MIMO-OFDM channel capacity was measured for a 4x4 array compared to a 2x2 array in presence of pedestrians. Channel capacity values derived from this analysis are important in terms of understanding the limitations and possibilities for MIMO-OFDM systems in indoor populated environments

Channel Capacity of High-speed Powerline Communication in Vehicles

Powerline Communication (PLC) Systems intents to use the mains network in vehicles for high-speed datatransmission. Carrier frequencies in the range of MHz are required to establish data rates of some megabits per second.In this paper, typical reference channels extracted from channel measurements are presented and computation results oftheir capacities according to Shannon\u27s theorem are presented. Furthermore, the effect of limitations of frequencyrange and power spectral density of transmitted signal on achievable capacity is investigated. This paper outlines anassessment for theoretical channel capacity and achievable data rates of vehicular PLC transmission schemes. Finally,EMC (Electromagnetics Compatibility) constraint according to CISPR 25 (Comite International Special desPerturbations Radioelectrique - The International Special Committee on Radio Interference) is deeply considered

Simple test for quantum channel capacity

Basing on states and channels isomorphism we point out that semidefinite programming can be used as a quick test for nonzero one-way quantum channel capacity. This can be achieved by search of symmetric extensions of states isomorphic to a given quantum channel. With this method we provide examples of quantum channels that can lead to high entanglement transmission but still have zero one-way capacity, in particular, regions of symmetric extendibility for isotropic states in arbitrary dimensions are presented. Further we derive {\it a new entanglement parameter} based on (normalised) relative entropy distance to the set of states that have symmetric extensions and show explicitly the symmetric extension of isotropic states being the nearest to singlets in the set of symmetrically extendible states. The suitable regularisation of the parameter provides a new upper bound on one-way distillable entanglement.Comment: 6 pages, no figures, RevTeX4. Signifficantly corrected version. Claim on continuity of channel capacities removed due to flaw in the corresponding proof. Changes and corrections performed in the part proposing a new upper bound on one-way distillable etanglement which happens to be not one-way entanglement monoton

Tema Con Variazioni: Quantum Channel Capacity

Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the mathematically precise statements of this idea which have been put forward in the literature. We show that all the variations considered lead to equivalent capacity definitions. In particular, it makes no difference whether one requires mean or maximal errors to go to zero, and it makes no difference whether errors are required to vanish for any sequence of block sizes compatible with the rate, or only for one infinite sequence.Comment: 32 pages, uses iopart.cl

Electromagnetic channel capacity for practical purposes

We give analytic upper bounds to the channel capacity C for transmission of classical information in electromagnetic channels (bosonic channels with thermal noise). In the practically relevant regimes of high noise and low transmissivity, by comparison with know lower bounds on C, our inequalities determine the value of the capacity up to corrections which are irrelevant for all practical purposes. Examples of such channels are radio communication, infrared or visible-wavelength free space channels. We also provide bounds to active channels that include amplification.Comment: 6 pages, 3 figures. NB: the capacity bounds are constructed by generalizing to the multi-mode case the minimum-output entropy bounds of arXiv:quant-ph/0404005 [Phys. Rev. A 70, 032315 (2004)