In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized in terms of the rank of the channel matrices. It is shown that linear precoding with Han-Kobayashi type of rate-splitting, i.e., splitting the information-be...

We consider the discrete memoryless two-sendertwo-receiver interference channel in the setting where received Channel Encoders ~~~~~~~~~~Decoders signals are sent back to their respective senders. The feedback Encoders xi Yi ~~~~~~~~~~~~U) signals enable each sender to crossly observe certain information j 111 traiismitted by the othelr, add thus facilitate the senders to cooperate in resolving...

In an M × N interference network, there are M transmitters and N receivers with each transmitter having independent messages for each of the 2 −1 possible non-empty subsets of the receivers. We consider the 2 × 2 interference network with 6 possible messages, of which the 2 × 2 interference channel and X channel are special cases obtained by using only 2 and 4 messages respectively. Starting fr...

An achievable region for the -channel multiple description coding problem is presented. This region generalizes twochannel results of El Gamal and Cover and of Zhang and Berger. It further generalizes three-channel results of Gray and Wyner and of Zhang and Berger. A source that is successively refinable on chains is shown to be successively refinable on trees. A new outer bound on the rate-dis...

cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with conferencing encoders (MACCE). For both situations, the two cases where the CSI is known to the encoders either non-causally or causally are studied. Achievable rate regions are established for both discrete mem...

We study the two-user MIMO block fading twoway relay channel in the non-coherent setting, where neither the terminals nor the relay have transmit or receive knowledge of the channel realizations. We present a lower bound on the achievable sum-rate with decode-and-forward (DF) at the relay node. As a byproduct we present an achievable pre-log region of the DF scheme, defined as the limiting rati...

In an M × N interference network, there are M transmitters and N receivers with each transmitter having independent messages for each of the 2 −1 possible non-empty subsets of the receivers. We consider the 2 × 2 interference network with 6 possible messages, of which the 2 × 2 interference channel and X channel are special cases obtained by using only 2 and 4 messages respectively. Starting fr...

We present a simplified form of the HK (= HanKobayashi) achievable rate region for the general interference channel by using Fourier-Motzkin algorithm, as well as a simplified form of the HK region without the don’t care inequalities. Also, in the same spirit, we give an improved form of the CMG (= Chong-Motani-Garg) region. I. THE ORIGINAL HK ACHIEVABLE REGION Let ω(y1y2|x1x2) be an interferen...

Title of dissertation: INFORMATION THEORETIC SECRET KEY GENERATION: STRUCTURED CODES AND TREE PACKING Sirin Nitinawarat, Doctor of Philosophy, 2010 Dissertation directed by: Professor Prakash Narayan Department of Electrical and Computer Engineering Institute for Systems Research This dissertation deals with a multiterminal source model for secret key generation by multiple network terminals wi...