# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 48

Publication Year: 2013, Page(s):C1 - C4
| |PDF (164 KB)
• ### IEEE Transactions on Information Theory publication information

Publication Year: 2013, Page(s): C2
| |PDF (143 KB)
• ### Lossy Joint Source-Channel Coding in the Finite Blocklength Regime

Publication Year: 2013, Page(s):2545 - 2575
Cited by:  Papers (37)
| |PDF (8858 KB) | HTML

This paper finds new tight finite-blocklength bounds for the best achievable lossy joint source-channel code rate, and demonstrates that joint source-channel code design brings considerable performance advantage over a separate one in the nonasymptotic regime. A joint source-channel code maps a block of $k$ source symbols onto a le... View full abstract»

• ### Saddle Point in the Minimax Converse for Channel Coding

Publication Year: 2013, Page(s):2576 - 2595
Cited by:  Papers (26)
| |PDF (5503 KB) | HTML

A minimax metaconverse has recently been proposed as a simultaneous generalization of a number of classical results and a tool for the nonasymptotic analysis. In this paper, it is shown that the order of optimizing the input and output distributions can be interchanged without affecting the bound. In the course of the proof, a number of auxiliary results of separate interest are obtained. In parti... View full abstract»

• ### Proof of the Outage Probability Conjecture for MISO Channels

Publication Year: 2013, Page(s):2596 - 2602
Cited by:  Papers (7)
| |PDF (2176 KB) | HTML

It is conjectured that the covariance matrices minimizing the outage probability under a power constraint for multiple-input multiple-output channels with Gaussian fading are diagonal with either zeros or constant values on the diagonal. In the multiple-input single-output (MISO) setting, this is equivalent to conjecture that the Gaussian quadratic forms having largest tail probability correspond ... View full abstract»

• ### Chain Rules for Smooth Min- and Max-Entropies

Publication Year: 2013, Page(s):2603 - 2612
Cited by:  Papers (16)
| |PDF (3181 KB) | HTML

The chain rule for the Shannon and von Neumann entropy, which relates the total entropy of a system to the entropies of its parts, is of central importance to information theory. Here, we consider the chain rule for the more general smooth min- and max-entropies, used in one-shot information theory. For these entropy measures, the chain rule no longer holds as an equality. However, the standard ch... View full abstract»

• ### On the Optimal Compressions in the Compress-and-Forward Relay Schemes

Publication Year: 2013, Page(s):2613 - 2628
Cited by:  Papers (28)
| |PDF (7331 KB) | HTML

In the classical compress-and-forward relay scheme developed by Cover and El Gamal, the decoding process operates in a successive way: the destination first decodes the compression of the relay's observation and then decodes the original message of the source. Recently, several modified compress-and-forward relay schemes were proposed, where the destination jointly decodes the compressi... View full abstract»

• ### State-Dependent Relay Channel: Achievable Rate and Capacity of a Semideterministic Class

Publication Year: 2013, Page(s):2629 - 2638
Cited by:  Papers (8)
| |PDF (3087 KB) | HTML

This paper considers the problem of communicating over a relay channel with state when noncausal state information is partially available at the nodes. We first establish a lower bound on the achievable rates based on noisy network coding and Gelfand-Pinsker coding, and show that it provides an alternative characterization of a previously known bound. We then introduce the class of state-decoupled... View full abstract»

• ### Bounds on the Capacity of the Relay Channel With Noncausal State at the Source

Publication Year: 2013, Page(s):2639 - 2672
Cited by:  Papers (21)
| |PDF (11067 KB) | HTML

We consider a three-terminal state-dependent relay channel with the channel state available noncausally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal transmission involving cognitive and noncognitive radios. We study the capacity of this communication model. One principal problem is caused by the relay's not knowi... View full abstract»

• ### The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel

Publication Year: 2013, Page(s):2673 - 2682
Cited by:  Papers (19)
| |PDF (2667 KB) | HTML

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian multiple-input multiple-output (MIMO) broadcast channel. An eavesdropper also receives the transmitted signal via another MIMO channel. We first consider the discrete memoryless channel and obtain the capacity region of the degraded channel. The secret... View full abstract»

• ### On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding

Publication Year: 2013, Page(s):2683 - 2693
Cited by:  Papers (4)
| |PDF (5029 KB) | HTML

We study the capacity region $C_{L}$ of an arbitrarily varying multiple-access channel (AVMAC) for deterministic codes with decoding into a list of a fixed size $L$ and for the average error probability criterion. Motivated by known results in the study of fixed size ... View full abstract»

• ### The Wideband Slope of Interference Channels: The Large Bandwidth Case

Publication Year: 2013, Page(s):2694 - 2712
Cited by:  Papers (1)
| |PDF (5232 KB) | HTML

It is well known that minimum received energy per bit Eb/N0|min in the interference channel is -1.59 dB as if there were no interference. Thus, the best way to mitigate interference is to operate the interference channel in the low-signal-to-noise-ratio ( SNR) regime. However, when the SNR is small but nonzero, Eb/N0|min alone... View full abstract»

• ### On the Symmetric Feedback Capacity of the K-User Cyclic Z-Interference Channel

Publication Year: 2013, Page(s):2713 - 2734
Cited by:  Papers (9)
| |PDF (6132 KB) | HTML

The K-user cyclic Z-interference channel models a situation in which the kth transmitter causes interference only to the (k-1)th receiver in a cyclic manner, e.g., the first transmitter causes interference only to the Kth receiver. The impact of noiseless feedback on the capacity of this channel is studied by focusing on the Gaussian cyclic Z-interference channel. To th... View full abstract»

• ### On the Robustness of Lattice Interference Alignment

Publication Year: 2013, Page(s):2735 - 2759
Cited by:  Papers (7)
| |PDF (5062 KB) | HTML

A static (constant channel gains) real $K$-user interference channel is considered, where all interference (cross) channel gains are integers. For such channels, previous results demonstrate that the number of degrees of freedom is very sensitive to slight variations in the direct channel gains. In this paper, we derive a... View full abstract»

• ### Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks

Publication Year: 2013, Page(s):2760 - 2776
Cited by:  Papers (55)
| |PDF (4663 KB) | HTML

We investigate the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected communicating pairs, content replication is efficient for certain regimes of file popularity, cache, and network size. Our study begins with the detailed joint content replica... View full abstract»

• ### Near-Optimal Quantization and Linear Network Coding for Relay Networks

Publication Year: 2013, Page(s):2777 - 2793
Cited by:  Papers (1)
| |PDF (3667 KB) | HTML

We introduce a discrete network corresponding to any Gaussian wireless network that is obtained by simply quantizing the received signals and restricting the transmitted signals to a finite precision. Since signals in the discrete network are obtained from those of a Gaussian network, the Gaussian network can be operated on the quantization-based digital interface defined by the discret... View full abstract»

• ### Incremental Relaying for the Gaussian Interference Channel With a Degraded Broadcasting Relay

Publication Year: 2013, Page(s):2794 - 2815
Cited by:  Papers (7)
| |PDF (5620 KB) | HTML

This paper studies incremental relay strategies for a two-user Gaussian relay-interference channel with an in-band-reception and out-of-band-transmission relay, where the link between the relay and the two receivers is modelled as a degraded broadcast channel. It is shown that generalized hash-and-forward (GHF) can achieve the capacity region of this channel to within a constant number of bits in ... View full abstract»

• ### Buffer-Aided Relaying With Adaptive Link Selection—Fixed and Mixed Rate Transmission

Publication Year: 2013, Page(s):2816 - 2840
Cited by:  Papers (68)
| |PDF (5555 KB) | HTML

We consider a simple network consisting of a source, a half-duplex decode-and-forward relay with a buffer, and a destination. We assume that the direct source–destination link is not available and all links undergo fading. We propose two new buffer-aided relaying schemes with different requirements regarding the availability of channel state information at the transmitter (CSIT).... View full abstract»

• ### Capacity and Stable Throughput Regions for the Broadcast Erasure Channel With Feedback: An Unusual Union

Publication Year: 2013, Page(s):2841 - 2862
Cited by:  Papers (10)
| |PDF (5326 KB) | HTML

We consider a source node broadcasting to two receivers over a general erasure channel with receiver feedback. We characterize the capacity region of the channel and construct algorithms based on linear network coding (either randomized or depending on channel dynamics) that achieve this capacity. We then consider stochastic arrivals at the source for the two destinations and characterize the stab... View full abstract»

• ### On the Feedback Capacity of the Fully Connected K-User Interference Channel

Publication Year: 2013, Page(s):2863 - 2881
Cited by:  Papers (10)
| |PDF (4605 KB) | HTML

The symmetric K-user interference channel with fully connected topology is considered, in which 1) each receiver suffers interference from all other (K-1) transmitters, and 2) each transmitter has causal and noiseless feedback from its respective receiver. The number of generalized degrees of freedom (ssr GDoF) is characterized in terms of α, where the interference-to-n... View full abstract»

• ### Degrees of Freedom for the Two-Cell Two-Hop MIMO Interference Channel: Interference-Free Relay Transmission and Spectrally Efficient Relaying Protocol

Publication Year: 2013, Page(s):2882 - 2896
Cited by:  Papers (17)
| |PDF (2994 KB) | HTML

This paper considers the two-cell two-hop multiple-input-multiple-output (MIMO) interference channel, where two source groups consisting of multiple users with a single antenna wish to communicate with two multiantenna destinations by sharing two multiantenna relays. For such a channel, an inner bound on the degrees of freedom is derived for different channel knowledge assumptions and relay operat... View full abstract»

• ### Optimal Selective Feedback Policies for Opportunistic Beamforming

Publication Year: 2013, Page(s):2897 - 2913
Cited by:  Papers (13)
| |PDF (4258 KB) | HTML

This paper studies the structure of downlink sum-rate maximizing selective decentralized feedback policies for opportunistic beamforming under finite feedback constraints on the average number of mobile users feeding back. First, it is shown that any sum-rate maximizing selective decentralized feedback policy must be a threshold feedback policy. This result holds for all fading channel ... View full abstract»

• ### Generalized Distributive Law for ML Decoding of Space–Time Block Codes

Publication Year: 2013, Page(s):2914 - 2935
Cited by:  Papers (5)
| |PDF (5057 KB) | HTML

The problem of designing good space–time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known ... View full abstract»

• ### Diversity Analysis of Randomized Linear Dispersion Codes in a Half-Duplex Amplify-and-Forward Multiple-Relay System

Publication Year: 2013, Page(s):2936 - 2959
Cited by:  Papers (4)
| |PDF (7621 KB) | HTML

A point-to-point multiple-relay communication system with half-duplex constraints is considered. The relays operate under the amplify-and-forward paradigm and implement a linear dispersion distributed space-time code with randomized dispersion matrices of independent and identically distributed entries. The large-signal-to-noise-ratio behavior of the asymptotically large deterministic system is st... View full abstract»

• ### Decoding by Embedding: Correct Decoding Radius and DMT Optimality

Publication Year: 2013, Page(s):2960 - 2973
Cited by:  Papers (6)
| |PDF (3018 KB) | HTML

The closest vector problem (CVP) and shortest (nonzero) vector problem (SVP) are the core algorithmic problems on Euclidean lattices. They are central to the applications of lattices in many problems of communications and cryptography. Kannan's embedding technique is a powerful technique for solving the approximate CVP; yet, its remarkable practical performance is not well understood. I... View full abstract»

## Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Prakash Narayan

Department of Electrical and Computer Engineering