The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Most communication systems use some form of feedback, often related to channel state information. The common models used in analyses either assume perfect channel state information...
A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted ...
A new variable-rate coding technique is presented for two-dimensional constraints. For certain constraints, such as the (0, 2)-RLL, (2, )-RLL, and the "no isolated bits" ...
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
A multiple-antenna Gaussian wiretap channel in which the number of antennas at the source is not greater than that at the eavesdropper is considered. Without feedback, the secrecy...