Channel Upgradation for Non-Binary Input Alphabets and MACs

Consider a single-user or multiple-access channel with a large output alphabet. A method to approximate the channel by an upgraded version having a smaller output alphabet is presented and analyzed. The original channel is not necessarily symmetric and does not necessarily have a binary input alphabet. Also, the input distribution is not necessarily uniform. The approximation method is instrumental when constructing capacity achieving polar codes for an asymmetric channel with a non-binary input alphabet. Other settings in which the method is instrumental are the wiretap setting as well as the lossy source coding setting.Comment: 18 pages, 2 figure

Coupling and Dissociation in Artificial Molecules

We show that the spin-and-space unrestricted Hartree-Fock method, in conjunction with the companion step of the restoration of spin and space symmetries via Projection Techniques (when such symmetries are broken), is able to describe the full range of couplings in two-dimensional double quantum dots, from the strong-coupling regime exhibiting delocalized molecular orbitals to the weak-coupling and dissociation regimes associated with a Generalized Valence Bond combination of atomic-type orbitals localized on the individual dots. The weak-coupling regime is always accompanied by an antiferromagnetic ordering of the spins of the individual dots. The cases of dihydrogen (H$_2$, $2e$) and dilithium (Li$_2$, $6e$) quantum dot molecules are discussed in detail.Comment: 7 pages. Latex with 4 GIF and 1 EPS figures. Based on an invited talk at the ISSPIC10 conference (see http://www.physics.gatech.edu/isspic10/) A version of the manuscript with high quality figures incorporated in the text is available at http://calcite.physics.gatech.edu/~costas/qds_isspic10.html For related papers, see http://www.prism.gatech.edu/~ph274c

The Arbitrarily Varying Broadcast Channel with Degraded Message Sets with Causal Side Information at the Encoder

In this work, we study the arbitrarily varying broadcast channel (AVBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the deterministic code capacity region with degraded message sets. The capacity region is then determined for a class of channels satisfying a condition on the mutual informations between the strategy variables and the channel outputs. As an example, we consider the arbitrarily varying binary symmetric broadcast channel with correlated noises. We show cases where the condition holds, hence the capacity region is determined, and other cases where there is a gap between the bounds.Comment: arXiv admin note: substantial text overlap with arXiv:1701.0334

The Arbitrarily Varying Relay Channel

We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well.Comment: arXiv admin note: text overlap with arXiv:1701.0334