# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 43

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

Publication Year: 2009, Page(s): C2
| PDF (42 KB)
• ### The Generalized Area Theorem and Some of its Consequences

Publication Year: 2009, Page(s):4793 - 4821
Cited by:  Papers (52)
| | PDF (1343 KB) | HTML

There is a fundamental relationship between belief propagation (BP) and maximum a posteriori decoding. The case of transmission over the binary erasure channel was investigated in detail in a companion paper (C. MEacuteasson, A. Montanari, and R. Urbanke, "Maxwell's construction: The hidden bridge between iterative and maximum a posteriori decoding," IEEE Transactions on Information Theo... View full abstract»

• ### Message Passing for Maximum Weight Independent Set

Publication Year: 2009, Page(s):4822 - 4834
Cited by:  Papers (45)
| | PDF (268 KB) | HTML

In this paper, we investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed-point estimate of max product can be mapped in a natural way to an extreme point of the linear programming (LP) polytope associated with the MWI... View full abstract»

• ### Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity

Publication Year: 2009, Page(s):4835 - 4859
Cited by:  Papers (32)
| | PDF (759 KB) | HTML

The problem of low complexity linear programming (LP) decoding of low-density parity-check (LDPC) codes is considered. An iterative algorithm, similar to min-sum and belief propagation, for efficient approximate solution of this problem was proposed by Vontobel and Koetter. In this paper, the convergence rate and computational complexity of this algorithm are studied using a scheduling scheme that... View full abstract»

• ### On the Minimal Distance of Binary Self-Dual Cyclic Codes

Publication Year: 2009, Page(s):4860 - 4863
Cited by:  Papers (2)
| | PDF (144 KB) | HTML

In this paper, an explicit construction of binary self-dual cyclic codes of length n going to infinity with a minimal distance at least half the square root of n is presented. The same idea is also used to construct more general binary cyclic codes with a large minimal distance. Finally, in the special case of self-dual cyclic codes, a simplified version of a proof by Conway and Sloa... View full abstract»

• ### Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs

Publication Year: 2009, Page(s):4864 - 4877
Cited by:  Papers (6)
| | PDF (368 KB) | HTML

A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear "local constraint" codes to be associated with the edges and vertices, respectively, of the graph. The kappa-complexity of a graphical realization is defined to be the largest dimension of any of its local constraint c... View full abstract»

• ### Joint Wyner–Ziv/Dirty-Paper Coding by Modulo-Lattice Modulation

Publication Year: 2009, Page(s):4878 - 4889
Cited by:  Papers (31)
| | PDF (391 KB) | HTML

The combination of source coding with decoder side information (the Wyner-Ziv problem) and channel coding with encoder side information (the Gel'fand-Pinsker problem) can be optimally solved using the separation principle. In this work, we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by applying a m... View full abstract»

• ### On Minimality of Convolutional Ring Encoders

Publication Year: 2009, Page(s):4890 - 4897
Cited by:  Papers (7)
| | PDF (200 KB) | HTML

Convolutional codes are considered with code sequences modeled as semi-infinite Laurent series. It is well known that a convolutional code C over a finite group G has a minimal trellis representation that can be derived from code sequences. It is also well known that, for the case that G is a finite field, any polynomial encoder of C can be algebraically manipulated to ... View full abstract»

• ### Some Optimal Binary and Ternary $t$-EC-AUED Codes

Publication Year: 2009, Page(s):4898 - 4904
| | PDF (153 KB) | HTML

Codes that can correct up to t symmetric errors and detect all unidirectional errors are studied. BOumlinck and van Tilborg gave a bound on the length of binary such codes. A generalization of this bound to arbitrary alphabet size is given. This generalized BOumlinck-van Tilborg bound, combined with constructions, is used to determine some optimal binary and ternary codes for correcting ... View full abstract»

• ### Spectra and Minimum Distances of Repeat Multiple–Accumulate Codes

Publication Year: 2009, Page(s):4905 - 4924
Cited by:  Papers (8)
| | PDF (458 KB) | HTML

In this paper, the ensembles of repeat multiple- accumulate codes (RAm), which are obtained by interconnecting a repeater with a cascade of m accumulate codes through uniform random interleavers, are analyzed. It is proved that the average spectral shapes of these code ensembles are equal to 0 below a threshold distance epsivm and, moreover, they form a nonincreasing sequence in m conve... View full abstract»

• ### $alpha$ -Divergence Is Unique, Belonging to Both $f$-Divergence and Bregman Divergence Classes

Publication Year: 2009, Page(s):4925 - 4931
Cited by:  Papers (41)
| | PDF (158 KB) | HTML

A divergence measure between two probability distributions or positive arrays (positive measures) is a useful tool for solving optimization problems in optimization, signal processing, machine learning, and statistical inference. The Csiszar f-divergence is a unique class of divergences having information monotonicity, from which the dual alpha geometrical structure with the Fisher m... View full abstract»

• ### The Degrees-of-Freedom of the $K$-User Gaussian Interference Channel Is Discontinuous at Rational Channel Coefficients

Publication Year: 2009, Page(s):4932 - 4946
Cited by:  Papers (71)
| | PDF (381 KB) | HTML

The degrees-of-freedom of a K-user Gaussian interference channel (GIC) has been defined to be the multiple of (1/2)log 2 P at which the maximum sum of achievable rates grows with increasing power P. In this paper, we establish that the degrees-of-freedom of three or more user, real, scalar GICs, viewed as a function of the channel coefficients, is discontinuo... View full abstract»

• ### Information Spectrum Approach to Second-Order Coding Rate in Channel Coding

Publication Year: 2009, Page(s):4947 - 4966
Cited by:  Papers (137)
| | PDF (492 KB) | HTML

In this paper, second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint epsiv is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, the additive Markovian case, and the Gaussian... View full abstract»

• ### Clustered Local Decoding for Wyner-Type Cellular Models

Publication Year: 2009, Page(s):4967 - 4985
Cited by:  Papers (14)
| | PDF (536 KB) | HTML

We study the uplink of Wyner-type cellular models featuring short range inter-cell interference. We assume that the decoding of the message sent by a given transmitter is done locally, that is using only the signals received at the antennas in its vicinity. We derive upper and lower bounds on the achievable rate for a two-dimensional model and for a one-dimensional model with an attenuation parame... View full abstract»

• ### Capacity Regions and Bounds for a Class of Z-Interference Channels

Publication Year: 2009, Page(s):4986 - 4994
Cited by:  Papers (19)
| | PDF (299 KB) | HTML

We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A channel in this class has the property that, for the transmitter-receiver pair that suffers from interference, the conditional output entropy at the receiver is invariant with respect to the transmitted codewords. We comp... View full abstract»

• ### Coding and Common Reconstruction

Publication Year: 2009, Page(s):4995 - 5010
Cited by:  Papers (37)
| | PDF (523 KB) | HTML

This work studies problems of source and joint source-channel coding under the requirement that the encoder can produce an exact copy of the compressed source constructed by the decoder. This requirement, termed here as the common reconstruction constraint (CR), is satisfied automatically in rate-distortion theory for single sources. However, in the common formulation of problems of lossy s... View full abstract»

• ### The Capacity Region of the Degraded Multiple-Input Multiple-Output Compound Broadcast Channel

Publication Year: 2009, Page(s):5011 - 5023
Cited by:  Papers (56)
| | PDF (339 KB) | HTML

The capacity region of a compound multiple-antenna broadcast channel is characterized when the users exhibit a certain degradedness order. The channel under consideration has two users, each user has a finite set of possible realizations. The transmitter transmits two messages, one for each user, in such a manner that regardless of the actual realizations, both users will be able to decode their m... View full abstract»

• ### On Minimal Eigenvalues of a Class of Tridiagonal Matrices

Publication Year: 2009, Page(s):5024 - 5031
Cited by:  Papers (3)
| | PDF (346 KB) | HTML

It is known that the worst case near-far resistance of optimum multiuser detectors for asynchronous Gaussian multiple-access channels can be expressed in terms of a class of block-tridiagonal matrices, and the minimal eigenvalues of such a class of block-tridiagonal matrices serve as a good measure of the worst case near-far resistance. In this paper, we focus on the two-user scenario where each b... View full abstract»

• ### On the Information Rate of MIMO Systems With Finite Rate Channel State Feedback Using Beamforming and Power On/Off Strategy

Publication Year: 2009, Page(s):5032 - 5047
Cited by:  Papers (22)
| | PDF (455 KB) | HTML

It is well known that multiple-input multiple-output (MIMO) systems have high spectral efficiency, especially when channel state information at the transmitter (CSIT) is available. In many practical systems, it is reasonable to assume that the CSIT is obtained by a limited (i.e., finite rate) feedback and is therefore imperfect. We consider the design problem of how to use the limited feedback res... View full abstract»

• ### A Central Limit Theorem for the SINR at the LMMSE Estimator Output for Large-Dimensional Signals

Publication Year: 2009, Page(s):5048 - 5063
Cited by:  Papers (24)  |  Patents (1)
| | PDF (760 KB) | HTML

This paper is devoted to the performance study of the linear minimum mean squared error (LMMSE) estimator for multidimensional signals in the large-dimension regime. Such an estimator is frequently encountered in wireless communications and in array processing, and the signal-to-interference-plus-noise ratio (SINR) at its output is a popular performance index. The SINR can be modeled as a random q... View full abstract»

• ### On the Diversity Gain of AF and DF Relaying With Noisy CSI at the Source Transmitter

Publication Year: 2009, Page(s):5064 - 5073
Cited by:  Papers (9)
| | PDF (367 KB) | HTML

The problem of optimizing resource allocation over a half-duplex relay channel with noisy channel state information at the source transmitter (CSIT) is studied, with a focus on the asymptotically high signal-to-noise ratio (SNR) regime. A novel upper bound on the diversity-multiplexing tradeoff (DMT) is derived, taking into account the quality of the CSIT. It is shown that from a DMT perspective, ... View full abstract»

• ### Distortion Minimization in Gaussian Layered Broadcast Coding With Successive Refinement

Publication Year: 2009, Page(s):5074 - 5086
Cited by:  Papers (33)
| | PDF (386 KB) | HTML

A transmitter without channel state information wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining the description in the previous one. The receiver decodes the layers that are supported by the channel realization and reconstructs the source up to a distortion. The expected distortion is min... View full abstract»

• ### On the Maximum Stable Throughput of Tree Algorithms With Free Access

Publication Year: 2009, Page(s):5087 - 5099
Cited by:  Papers (2)
| | PDF (379 KB) | HTML

A simple numerical procedure is presented to determine the maximum stable throughput (MST) of various tree algorithms with free access by defining an associated multitype branching process such that the criticality of the branching process corresponds to the stability of the tree algorithm. More precisely, a bisection algorithm is proposed that only requires the computation of the dominant eigenva... View full abstract»

• ### The Two-User Compound Interference Channel

Publication Year: 2009, Page(s):5100 - 5120
Cited by:  Papers (17)
| | PDF (428 KB) | HTML

We introduce the two-user finite state compound interference channel. The main contributions involve both novel inner and outer bounds. For the Gaussian case, we characterize its capacity region to within one bit. The inner bound is multilevel superposition coding but the decoding of the levels is opportunistic, depending on the channel state. The genie aided outer bound is motivated by the typica... 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