# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 43

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

Publication Year: 2008, Page(s): C2
| PDF (41 KB)
• ### Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding

Publication Year: 2008, Page(s):5277 - 5307
Cited by:  Papers (57)
| | PDF (1256 KB) | HTML

There is a fundamental relationship between belief propagation and maximum a posteriori decoding. A decoding algorithm, which is called the Maxwell decoder, is introduced and provides a constructive description of this relationship. Both the algorithm itself and the analysis of the new decoder are reminiscent of the Maxwell construction in thermodynamics. This paper investigates in d... View full abstract»

• ### Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes

Publication Year: 2008, Page(s):5308 - 5331
Cited by:  Papers (13)
| | PDF (750 KB) | HTML

We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the tradeoff between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's local lemma (LLL) and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrice... View full abstract»

• ### On the Weight Distributions of Two Classes of Cyclic Codes

Publication Year: 2008, Page(s):5332 - 5344
Cited by:  Papers (69)
| | PDF (489 KB) | HTML

Let q=pm where p is an odd prime, mges2, and 1lesklesm-1. Let Tr be the trace mapping from Fq to Fp and zetap=e2pii/p be a primitive pth root of unity. In this paper, we determine the value distribution of the following exponential sums: SigmaxisinF qchi(alphaxp k +1+betax2) (al... View full abstract»

• ### Cyclic Codes and Sequences From Generalized Coulter–Matthews Function

Publication Year: 2008, Page(s):5345 - 5353
Cited by:  Papers (39)
| | PDF (248 KB) | HTML

In this paper, we will study the exponential sum SigmaxisinFq x(alphax(pk+1)/2+betax) that is related to the generalized Coulter-Matthews function x(pk+1)/2 with k/gcd. As applications, we obtain the following: the correlation distribution of a p-ary m-sequence and a decimated m-sequence of degree pk+1/2; the weight distribution of the cyclic code whose dual has tw... View full abstract»

• ### Sharp $p$ -Divisibility of Weights in Abelian Codes Over ${BBZ}/p^d{BBZ}$

Publication Year: 2008, Page(s):5354 - 5380
Cited by:  Papers (1)
| | PDF (724 KB) | HTML

A theorem of McEliece on the p-divisibility of Hamming weights in cyclic codes over Fp is generalized to Abelian codes over Zopf/p dZopf. This work improves upon results of Helleseth-Kumar-Moreno-Shanbhag, Calderbank-Li-Poonen, Wilson, and Katz. These previous attempts are not sharp in general, i.e., do not report the full extent of the p -divisibility ex... View full abstract»

• ### Weil-Serre Type Bounds for Cyclic Codes

Publication Year: 2008, Page(s):5381 - 5395
Cited by:  Papers (5)
| | PDF (384 KB) | HTML

We give a new method in order to obtain Weil-Serre type bounds on the minimum distance of arbitrary cyclic codes over Fpe of length coprime to p, where e ges 1 is an arbitrary integer. In an earlier paper we obtained Weil-Serre type bounds for such codes only when e =1 or e =2 using lengthy explicit factorizations, which seems hopeless to generalize. The new method avoids such explicit ... View full abstract»

• ### Adaptive Methods for Linear Programming Decoding

Publication Year: 2008, Page(s):5396 - 5410
Cited by:  Papers (68)  |  Patents (1)
| | PDF (406 KB) | HTML

Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the underlying LP problem. In this paper, we make a first step in studying this method, and show that by starting from a simple LP problem and adaptively adding the necessary constraints, the complexity o... View full abstract»

• ### Orthogonal Codes for Robust Low-Cost Communication

Publication Year: 2008, Page(s):5411 - 5426
Cited by:  Papers (2)
| | PDF (382 KB) | HTML

Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which exhibit uncertainties in their input-output statistical relationships. A minimax formulation is adopted to attain robustness. First, a class of achievable rates pe... View full abstract»

• ### An Analysis of the MIMO–SDMA Channel With Space–Time Orthogonal and Quasi-Orthogonal User Transmissions and Efficient Successive Cancellation Decoders

Publication Year: 2008, Page(s):5427 - 5446
Cited by:  Papers (2)
| | PDF (668 KB) | HTML

We consider space-time transceiver architectures for space-division multiple-access (SDMA) fading channels with simultaneous transmissions from multiple users. Each user has up to four transmit antennas and employs a space-time orthogonal or a quasi-orthogonal design as an inner code. At the multiple-antenna receiver, efficient successive group interference cancellation strategies based on zero-fo... View full abstract»

• ### Bit-Interleaved Coded Modulation in the Wideband Regime

Publication Year: 2008, Page(s):5447 - 5455
Cited by:  Papers (24)  |  Patents (1)
| | PDF (238 KB) | HTML

The wideband regime of bit-interleaved coded modulation (BICM) in Gaussian channels is studied. The Taylor expansion of the coded modulation capacity for generic signal constellations at low signal-to-noise ratio (SNR) is derived and used to determine the corresponding expansion for the BICM capacity. Simple formulas for the minimum energy per bit and the wideband slope are given. BICM is found to... View full abstract»

Publication Year: 2008, Page(s):5456 - 5468
Cited by:  Papers (1)
| | PDF (363 KB) | HTML

A transmit-receive diversity system in correlated Rayleigh fading in which the receiver estimates the channel through pilot symbols, and feeds this information back to the transmitter through a feedback path, is considered. The imperfect channel state information (CSI) is used by the transmitter to obtain the transmit weight vector for data transmission. The optimum receiver in the maximum-likelih... View full abstract»

• ### A Calculus for Log-Convex Interference Functions

Publication Year: 2008, Page(s):5469 - 5490
Cited by:  Papers (17)
| | PDF (458 KB) | HTML

The behavior of certain interference-coupled multiuser systems can be modeled by means of logarithmically convex (log-convex) interference functions. In this paper, we show fundamental properties of this framework. A key observation is that any log-convex interference function can be expressed as an optimum over elementary log-convex interference functions. The results also contribute to a better ... View full abstract»

• ### Distributed Downlink Beamforming With Cooperative Base Stations

Publication Year: 2008, Page(s):5491 - 5499
Cited by:  Papers (111)  |  Patents (3)
| | PDF (297 KB) | HTML

In this paper, we consider multicell processing on the downlink of a cellular network to accomplish ldquomacrodiversityrdquo transmit beamforming. The particular downlink beamformer structure we consider allows a recasting of the downlink beamforming problem as a virtual linear mean square error (LMMSE) estimation problem. We exploit the structure of the channel and develop distributed beamforming... View full abstract»

• ### A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications

Publication Year: 2008, Page(s):5500 - 5510
Cited by:  Papers (60)
| | PDF (442 KB) | HTML

In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified framework is introduced that permits the geometric characterization of fading by incorporating the fading process into the point process model. Concretely, assuming nodes are distributed in a stationary Poisson point process in Rd... View full abstract»

• ### On the Delay and Throughput Gains of Coding in Unreliable Networks

Publication Year: 2008, Page(s):5511 - 5524
Cited by:  Papers (85)
| | PDF (640 KB) | HTML

In an unreliable packet network setting, we study the performance gains of optimal transmission strategies in the presence and absence of coding capability at the transmitter, where performance is measured in delay and throughput. Although our results apply to a large class of coding strategies including maximum-distance separable (MDS) and Digital Fountain codes, we use random network codes in ou... View full abstract»

• ### Universal Delay-Limited Simulation

Publication Year: 2008, Page(s):5525 - 5533
Cited by:  Papers (3)
| | PDF (233 KB) | HTML

Universal, delay-limited simulation of an unknown information source of a certain parametric family (e.g., the family of memoryless sources or Markov sources of a given order), given a training sequence from that source and a stream of independent and uniformly distributed bits, is considered. The goal of universal simulation is that the probability law of the generated sequence be identical to th... View full abstract»

• ### Gaussian Interference Channel Capacity to Within One Bit

Publication Year: 2008, Page(s):5534 - 5562
Cited by:  Papers (724)  |  Patents (1)
| | PDF (1214 KB) | HTML

The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in som... View full abstract»

• ### Universal Lossless Compression of Erased Symbols

Publication Year: 2008, Page(s):5563 - 5574
| | PDF (589 KB) | HTML

A source X goes through an erasure channel whose output is Z. The goal is to compress losslessly X when the compressor knows X and Z and the decompressor knows Z. We propose a universal algorithm based on context-tree weighting (CTW), parameterized by a memory-length parameter. We show that if the erasure channel is stationary and memoryless, and X ... View full abstract»

• ### Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

Publication Year: 2008, Page(s):5575 - 5590
Cited by:  Papers (9)
| | PDF (388 KB) | HTML

Consider a source network in which a finite alphabet source X = {Xi}i=0 infin is to be encoded and transmitted, and another finite alphabet source Y = {Xi}i=0 infin correlated with X is available only to the decoder as side information. Traditionally, the channel between the encoder and decoder in the source network is assumed to be... View full abstract»

• ### Side-Information Scalable Source Coding

Publication Year: 2008, Page(s):5591 - 5608
Cited by:  Papers (26)
| | PDF (493 KB) | HTML

We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high quality side information will be able to use only the first layer to reconstruct the source in a lossy manner, while the receiver with low quality side information will have to receive both layers in order to decode. We provide inn... View full abstract»

• ### Scanning and Sequential Decision Making for Multidimensional Data—Part II: The Noisy Case

Publication Year: 2008, Page(s):5609 - 5631
Cited by:  Papers (8)
| | PDF (828 KB) | HTML

We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged with respect to the clean data. In particular, we first consider the problem of scanning and sequentially filtering noisy random fields. In this case, the sequential filter is given the freedom to choose the path over whic... View full abstract»

• ### Universal Denoising of Discrete-Time Continuous-Amplitude Signals

Publication Year: 2008, Page(s):5632 - 5660
Cited by:  Papers (6)
| | PDF (3363 KB) | HTML

We consider the problem of reconstructing a discrete-time signal (sequence) with continuous-valued components corrupted by a known memoryless channel. When performance is measured using a per-symbol loss function satisfying mild regularity conditions, we develop a sequence of denoisers that, although independent of the distribution of the underlying ldquocleanrdquo sequence, is universally optimal... View full abstract»

• ### Stability Results for Random Sampling of Sparse Trigonometric Polynomials

Publication Year: 2008, Page(s):5661 - 5670
Cited by:  Papers (53)
| | PDF (297 KB) | HTML

Recently, it has been observed that a sparse trigonometric polynomial, i.e., having only a small number of nonzero coefficients, can be reconstructed exactly from a small number of random samples using basis pursuit (BP) or orthogonal matching pursuit (OMP). In this paper, it is shown that recovery by a BP variant is stable under perturbation of the samples values by noise. A similar partial resul... 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