# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 43

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

Publication Year: 2012, Page(s): C2
| PDF (42 KB)
• ### Rate Distortion Behavior of Sparse Sources

Publication Year: 2012, Page(s):4969 - 4992
Cited by:  Papers (24)
| | PDF (5369 KB) | HTML

The rate distortion behavior of sparse memoryless sources is studied. These serve as models of sparse signal representations and facilitate the performance analysis of “sparsifying” transforms like the wavelet transform and nonlinear approximation schemes. For strictly sparse binary sources with Hamming distortion, R(D) is shown to be almost linear. For nonstrictly sparse continuous-valued sources... View full abstract»

• ### Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals

Publication Year: 2012, Page(s):4993 - 5015
Cited by:  Papers (20)
| | PDF (4534 KB) | HTML

In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI techniques and the underlying sampling methods. We first obtain a fundamental limit on the estimation accuracy attainable regardless of the sampling method. Next, we provide a bound on the performance achievable using any specifi... View full abstract»

• ### Compressible Distributions for High-Dimensional Statistics

Publication Year: 2012, Page(s):5016 - 5034
Cited by:  Papers (34)
| | PDF (4443 KB) | HTML

We develop a principled way of identifying probability distributions whose independent and identically distributed realizations are compressible, i.e., can be well approximated as sparse. We focus on Gaussian compressed sensing, an example of underdetermined linear regression, where compressibility is known to ensure the success of estimators exploiting sparse regularization. We prove that many di... View full abstract»

• ### Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves

Publication Year: 2012, Page(s):5035 - 5041
Cited by:  Papers (53)
| | PDF (1457 KB) | HTML

Compressed sensing is a sampling technique which provides a fundamentally new approach to data acquisition. Comparing with traditional methods, compressed sensing makes full use of sparsity so that a sparse signal can be reconstructed from very few measurements. A central problem in compressed sensing is the construction of sensing matrices. While random sensing matrices have been studied intensiv... View full abstract»

• ### Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing

Publication Year: 2012, Page(s):5042 - 5058
Cited by:  Papers (28)
| | PDF (4537 KB) | HTML

This paper considers the performance of (j, k)-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binary erasure channel (BEC) and the q-ary symmetric channel (q-SC). For the BEC and a fixed j, the density evolution (DE) threshold of iterative de... View full abstract»

• ### Distributed Source Coding of Correlated Gaussian Remote Sources

Publication Year: 2012, Page(s):5059 - 5085
Cited by:  Papers (16)
| | PDF (8955 KB) | HTML

We consider the distributed source coding system for L correlated memoryless Gaussian remote sources specified with L correlated Gaussian random variables X<sub>i</sub>, i=1,2,...,L. We deal with the case where each of L distributed encoders cannot directly observe the source X<sub>i</sub> but its noisy version Y<sub>i</sub>=X<sub>i</sub>+N<sub>... View full abstract»

• ### Reliability in Source Coding With Side Information

Publication Year: 2012, Page(s):5086 - 5111
Cited by:  Papers (14)
| | PDF (700 KB) | HTML

We study error exponents for source coding with side information. Both achievable exponents and converse bounds are obtained for the following two cases: lossless source coding with coded information and lossy source coding with full side information (Wyner-Ziv). These results recover and extend several existing results on source-coding error exponents and are tight in some circumstances. Our boun... View full abstract»

• ### On Optimal and Achievable Fix-Free Codes

Publication Year: 2012, Page(s):5112 - 5129
Cited by:  Papers (11)
| | PDF (5698 KB) | HTML

Fix-free codes are prefix condition codes which can also be decoded in the reverse direction. They have attracted attention from several communities and are used in video standards. Two variations (with additional constraints) have also been considered for joint source-channel coding: 1) “symmetric” codes, which require the codewords to be palindromes; 2) codes with distance constraints on pairs o... View full abstract»

• ### Interference Alignment and the Generalized Degrees of Freedom of the$X$Channel

Publication Year: 2012, Page(s):5130 - 5150
Cited by:  Papers (42)
| | PDF (5581 KB) | HTML

We explore the capacity and generalized degrees of freedom (GDOF) of the two-user Gaussian X channel, i.e., a generalization of the two-user interference channel where there is an independent message from each transmitter to each receiver. There are three main results in this paper. First, we characterize the sum capacity of the deterministic X channel under a symmetric setting. Second, we charact... View full abstract»

• ### Symmetric Capacity of the Gaussian Interference Channel With an Out-of-Band Relay to Within 1.15 Bits

Publication Year: 2012, Page(s):5151 - 5171
Cited by:  Papers (18)
| | PDF (4807 KB) | HTML

This paper studies the Gaussian interference channel (IC) with a relay, which transmits and receives in a band that is orthogonal to the IC. The channel associated with the relay is thus an out-of-band relay channel (OBRC). The focus is on a symmetric channel model, in order to assess the fundamental impact of the OBRC on the signal interaction of the IC, in the simplest possible setting. First, t... View full abstract»

• ### The Capacity Region of the Fading Interference Channel With a Relay in the Strong Interference Regime

Publication Year: 2012, Page(s):5172 - 5184
Cited by:  Papers (12)
| | PDF (3670 KB) | HTML

The interference channel with a relay (ICR) is the fundamental building block of cooperation in wireless networks where there are multiple communicating pairs interfering with each other. This paper considers ICRs in which the links are subject to i.i.d. fading, and each node has channel state information (CSI) only on its incoming links (receive CSI). Two channel models are considered: phase fadi... View full abstract»

• ### Capacity Theorems for the Fading Interference Channel With a Relay and Feedback Links

Publication Year: 2012, Page(s):5185 - 5213
Cited by:  Papers (4)
| | PDF (8657 KB) | HTML

Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this paper, we consider simultaneous application of both cooperation types in the presence of interference. We obtain exact characterization of the capacity regions fo... View full abstract»

• ### The Degrees of Freedom of Compute-and-Forward

Publication Year: 2012, Page(s):5214 - 5232
Cited by:  Papers (46)
| | PDF (4492 KB) | HTML

We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network consisting of K transmitters and K relays. The aim of the relays is to reliably decode an invertible function of the messages sent by the transmitters. An upper bound on the capacity of this system can be obtained by allowing full cooperatio... View full abstract»

• ### Upper Bounds on the Capacities of Noncontrollable Finite-State Channels With/Without Feedback

Publication Year: 2012, Page(s):5233 - 5247
Cited by:  Papers (1)
| | PDF (3845 KB) | HTML

Noncontrollable finite-state channels (FSCs) are FSCs in which the channel inputs have no influence on the channel states, i.e., the channel states evolve freely. Since single-letter formulas for the channel capacities are rarely available for general noncontrollable FSCs, computable bounds are usually utilized to numerically bound the capacities. In this paper, we take the delayed channel state a... View full abstract»

• ### Feedback-Based Collaborative Secrecy Encoding Over Binary Symmetric Channels

Publication Year: 2012, Page(s):5248 - 5266
Cited by:  Papers (5)
| | PDF (5053 KB) | HTML

In this paper, we propose a feedback scheme for transmitting secret messages between two legitimate parties, over an eavesdropped communication link. Relative to Wyner's traditional encoding scheme, our feedback-based encoding often yields larger rate-equivocation regions and achievable secrecy rates. More importantly, by exploiting the channel randomness inherent in the feedback channels, our sch... View full abstract»

• ### LQG Control Approach to Gaussian Broadcast Channels With Feedback

Publication Year: 2012, Page(s):5267 - 5278
Cited by:  Papers (20)
| | PDF (2345 KB) | HTML

A code for communication over the k-receiver complex additive white Gaussian noise broadcast channel (BC) with feedback is presented and analyzed using tools from the theory of linear quadratic Gaussian optimal control. It is shown that the performance of this code depends on the noise correlation at the receivers and it is related to the solution of a discrete algebraic Riccati equation. For the ... View full abstract»

• ### Chain Independence and Common Information

Publication Year: 2012, Page(s):5279 - 5286
| | PDF (2158 KB) | HTML

We present a new proof of a celebrated result of Gács and Körner that the common information is far less than the mutual information. Consider two sequences α1,... αnand β1,... βnof random variables, where pairs (α1, β1),... (αn, βn) are independent and identically distributed. Gács and Körner proved that it is... View full abstract»

• ### Data-Processing Inequalities Based on a Certain Structured Class of Information Measures With Application to Estimation Theory

Publication Year: 2012, Page(s):5287 - 5301
Cited by:  Papers (8)
| | PDF (4039 KB) | HTML

We study data-processing inequalities that are derived from a certain class of generalized information measures, where a series of convex functions and multiplicative likelihood ratios is nested alternately. While these information measures can be viewed as a special case of the most general Zakai-Ziv generalized information measure, this special nested structure calls for attention and motivates ... View full abstract»

• ### Using Hermite Bases in Studying Capacity-Achieving Distributions Over AWGN Channels

Publication Year: 2012, Page(s):5302 - 5322
Cited by:  Papers (11)
| | PDF (4267 KB) | HTML

This paper studies classes of generic deterministic, discrete time, memoryless, and “nonlinear” additive white Gaussian noise (AWGN) channels. Subject to multiple types of constraints such as the even-moment and compact-support constraints or a mixture, the optimal input is proved to be discrete with finite number of mass points in the vast majority of the cases. Only under the even-moment constra... View full abstract»

• ### Multilayer Coding Over Multihop Single-User Networks

Publication Year: 2012, Page(s):5323 - 5337
Cited by:  Papers (5)
| | PDF (3179 KB) | HTML

This paper considers a two-hop network in which information is transmitted from a source via a relay to a destination. It is assumed that channels are quasi-static fading with additive white Gaussian noise and that all nodes are equipped with a single antenna. The channel state information (CSI) of each hop is available only at the corresponding receiver and relay is not capable of data buffering ... View full abstract»

• ### $(n,K)$-User Interference Channels: Degrees of Freedom

Publication Year: 2012, Page(s):5338 - 5353
Cited by:  Papers (6)
| | PDF (4130 KB) | HTML

This paper analyzes the gains of opportunistic communication in multiuser interference channels. Consider a fully connected n-user Gaussian interference channel. At each time instance, only K≤n transmitters are allowed to be communicating with their respective receivers and the remaining (n-K) transmitter-receiver pairs remain inactive. For finite n, if the transmitters can acquire the instantaneo... View full abstract»

• ### The Degree-of-Freedom Regions of MIMO Broadcast, Interference, and Cognitive Radio Channels With No CSIT

Publication Year: 2012, Page(s):5354 - 5374
Cited by:  Papers (106)
| | PDF (4449 KB) | HTML

The degree-of-freedom (DoF) regions are characterized for the multiple-input multiple-output (MIMO) broadcast channel (BC), interference channels (ICs), including X and multihop ICs, and the cognitive radio channel (CRC), when there is no channel state information at the transmitter(s) (CSIT) and for fading distributions in which transmit directions are statistically indistinguishable. For the K-u... View full abstract»

• ### Asymptotic Spectral Efficiency of Multiantenna Links in Wireless Networks With Limited Tx CSI

Publication Year: 2012, Page(s):5375 - 5387
Cited by:  Papers (10)
| | PDF (2877 KB) | HTML

An asymptotic technique is presented for finding the spectral efficiency of multiantenna links in spatially distributed wireless networks where transmitters have channel-state-information (CSI) corresponding to their target receiver. Transmitters are assumed to transmit independent data streams on a limited number of channel modes which limits the rank of transmit covariance matrices. An approxima... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu