# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 46

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

Publication Year: 2006, Page(s): C2
| |PDF (38 KB)
• ### The Distributed Karhunen–Loève Transform

Publication Year: 2006, Page(s):5177 - 5196
Cited by:  Papers (94)
| |PDF (507 KB) | HTML

The Karhunen-Loeve transform (KLT) is a key element of many signal processing and communication tasks. Many recent applications involve distributed signal processing, where it is not generally possible to apply the KLT to the entire signal; rather, the KLT must be approximated in a distributed fashion. This paper investigates such distributed approaches to the KLT, where several distributed termin... View full abstract»

• ### Multiple Description Quantization Via Gram–Schmidt Orthogonalization

Publication Year: 2006, Page(s):5197 - 5217
Cited by:  Papers (41)
| |PDF (562 KB) | HTML

The multiple description (MD) problem has received considerable attention as a model of information transmission over unreliable channels. A general framework for designing efficient MD quantization schemes is proposed in this paper. We provide a systematic treatment of the El Gamal-Cover (EGC) achievable MD rate-distortion region, and show it can be decomposed into a simplified-EGC (SEGC) region ... View full abstract»

• ### Source Coding With Limited-Look-Ahead Side Information at the Decoder

Publication Year: 2006, Page(s):5218 - 5239
Cited by:  Papers (36)
| |PDF (596 KB) | HTML

We characterize the rate distortion function for the source coding with decoder side information setting when the ith reconstruction symbol is allowed to depend only on the first i+lscr side information symbols, for some finite look-ahead lscr, in addition to the index from the encoder. For the case of causal side information, i.e., lscr=0, we find that the penalty of causality is the omission of ... View full abstract»

• ### Universal Zero-Delay Joint Source–Channel Coding

Publication Year: 2006, Page(s):5240 - 5250
Cited by:  Papers (18)  |  Patents (1)
| |PDF (307 KB) | HTML

We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channel c... View full abstract»

• ### Analyticity of Entropy Rate of Hidden Markov Chains

Publication Year: 2006, Page(s):5251 - 5266
Cited by:  Papers (28)
| |PDF (394 KB) | HTML

We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine the domain of analyticity is stated. An example is given to estimate the radius of convergence for the entropy rate. We then show that the positivity assumptions can be relaxed, and examples are given... View full abstract»

• ### On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm

Publication Year: 2006, Page(s):5267 - 5283
Cited by:  Papers (10)
| |PDF (398 KB) | HTML

We derive several almost-sure results related to the sliding-window Lempel-Ziv (SWLZ) algorithm. A principal result is a path-wise lower bound to the redundancy equal to 1/2hlog2log 2nw/log2nw in the main term, where nw is the sliding window size. This bound is off by a factor of two from the main term in the lower bound of A. J. Wy... View full abstract»

• ### Outage Theorems for MIMO Block-Fading Channels

Publication Year: 2006, Page(s):5284 - 5296
Cited by:  Papers (20)
| |PDF (359 KB) | HTML

The connection between the average codeword or frame error probability (FEP) of space-time codes and the outage probability over general block-fading multiple-input multiple-output (MIMO) channels is established. Three archetypal problems are considered under general fading distributions in a single framework wherein the receiver has channel state information whereas the transmitter knows a) the f... View full abstract»

• ### On the Diversity Order of Spatial Multiplexing Systems With Transmit Antenna Selection: A Geometrical Approach

Publication Year: 2006, Page(s):5297 - 5311
Cited by:  Papers (30)
| |PDF (438 KB) | HTML

In recent years, the remarkable ability of multiple-input-multiple-output (MIMO) wireless communication systems to provide spatial diversity or multiplexing gains has been clearly demonstrated. For MIMO diversity schemes, it is well known that antenna selection methods that optimize the postprocessing signal-to-noise ratio (SNR) can preserve the diversity order of the original full-size MIMO syste... View full abstract»

• ### Achieving the Optimal Diversity-Versus-Multiplexing Tradeoff for MIMO Flat Channels With QAM Space–Time Spreading and DFE Equalization

Publication Year: 2006, Page(s):5312 - 5323
Cited by:  Papers (15)
| |PDF (621 KB) | HTML

The use of multiple transmit (Tx) and receive (Rx) antennas allows to transmit multiple signal streams in parallel and hence to increase communication capacity. We have previously introduced simple convolutive linear precoding schemes that spread transmitted symbols in time and space, involving spatial spreading, delay diversity and possibly temporal spreading. In this paper we show that the use o... View full abstract»

• ### Geometrical Relations Between Space–Time Block Code Designs and Complexity Reduction

Publication Year: 2006, Page(s):5324 - 5335
Cited by:  Papers (13)
| |PDF (385 KB) | HTML

In this work, the geometric relation between space- time block code design for the coherent channel and its noncoherent counterpart is exploited to get an analog of the information-theoretic inequality I(X;S)lesI((X,H);S) in terms of diversity. It provides a lower bound on the performance of noncoherent codes when used in coherent scenarios. This leads in turn to a code design decomposition result... View full abstract»

• ### Capacity and Character Expansions: Moment-Generating Function and Other Exact Results for MIMO Correlated Channels

Publication Year: 2006, Page(s):5336 - 5351
Cited by:  Papers (47)
| |PDF (409 KB) | HTML

A promising new method from the field of representations of Lie groups is applied to calculate integrals over unitary groups, which are important for multiantenna communications. To demonstrate the power and simplicity of this technique, a number of recent results are rederived, using only a few simple steps. In particular, we derive the joint probability distribution of eigenvalues of the matrix ... View full abstract»

• ### Threshold Functions, Node Isolation, and Emergent Lacunae in Sensor Networks

Publication Year: 2006, Page(s):5352 - 5372
Cited by:  Papers (7)
| |PDF (667 KB) | HTML

A geometrically random network of sensors is obtained by modeling sensors as random points in the unit disc equipped with a local sensing capability and the ability to communicate with other sensors in their vicinity. Node extinctions in the network representing the finite battery lifetimes of the sensors are modeled as a sequence of independent random variables governed by a common probability di... View full abstract»

• ### Network Tomography of Binary Network Performance Characteristics

Publication Year: 2006, Page(s):5373 - 5388
Cited by:  Papers (94)
| |PDF (568 KB) | HTML

In network performance tomography, characteristics of the network interior, such as link loss and packet latency, are inferred from correlated end-to-end measurements. Most work to date is based on exploiting packet level correlations, e.g., of multicast packets or unicast emulations of them. However, these methods are often limited in scope-multicast is not widely deployed-or require deployment o... View full abstract»

• ### Signal Parameter Estimation Using 1-Bit Dithered Quantization

Publication Year: 2006, Page(s):5389 - 5405
Cited by:  Papers (41)
| |PDF (353 KB) | HTML

Motivated by the estimation of spatio-temporal events with cheap, simple sensors, we consider the problem of estimation of a parameter thetas of a signal s(x;thetas) corrupted by noise assuming that only 1-bit precision dithered quantized samples are available. An estimate that does not require the knowledge of the dither signal and the noise distribution is proposed, and it is analyzed in detail ... View full abstract»

• ### Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

Publication Year: 2006, Page(s):5406 - 5425
Cited by:  Papers (2839)  |  Patents (38)
| |PDF (458 KB) | HTML

Suppose we are given a vector f in a class FsubeRopfN , e.g., a class of digital signals or digital images. How many linear measurements do we need to make about f to be able to recover f to within precision epsi in the Euclidean (lscr2) metric? This paper shows that if the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f t... View full abstract»

• ### Turbo Decoding as Iterative Constrained Maximum-Likelihood Sequence Detection

Publication Year: 2006, Page(s):5426 - 5437
Cited by:  Papers (13)
| |PDF (360 KB) | HTML

The turbo decoder was not originally introduced as a solution to an optimization problem, which has impeded attempts to explain its excellent performance. Here it is shown, that the turbo decoder is an iterative method seeking a solution to an intuitively pleasing constrained optimization problem. In particular, the turbo decoder seeks the maximum-likelihood sequence (MLS) under the false assumpti... View full abstract»

• ### Broadcast Channels With Cooperating Decoders

Publication Year: 2006, Page(s):5438 - 5454
Cited by:  Papers (98)
| |PDF (434 KB) | HTML

We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find ... View full abstract»

• ### On Self-Healing Key Distribution Schemes

Publication Year: 2006, Page(s):5455 - 5467
Cited by:  Papers (10)
| |PDF (289 KB) | HTML

Self-healing key distribution schemes allow group managers to broadcast session keys to large and dynamic groups of users over unreliable channels. Roughly speaking, even if during a certain session some broadcast messages are lost due to network faults, the self-healing property of the scheme enables each group member to recover the key from the broadcast messages he has received before and after... View full abstract»

• ### Capacity With Causal and Noncausal Side Information: A Unified View

Publication Year: 2006, Page(s):5468 - 5474
Cited by:  Papers (79)
| |PDF (245 KB) | HTML

In this correspondence, we identify the common underlying form of the capacity expression that is applicable to both cases where causal or noncausal side information is made available to the transmitter. A genie-aided outerbound is developed that states that when a genie provides n bits of side information to a receiver the resulting capacity improvement cannot be more than n bits. Using the genie... View full abstract»

• ### Decoding of Expander Codes at Rates Close to Capacity

Publication Year: 2006, Page(s):5475 - 5485
Cited by:  Papers (1)
| |PDF (453 KB) | HTML

The decoding error probability of codes is studied as a function of their block length. It is shown that the existence of codes with a polynomially small decoding error probability implies the existence of codes with an exponentially small decoding error probability. Specifically, it is assumed that there exists a family of codes of length N and rate R=(1-epsiv)C (C is a capacity of a binary-symme... View full abstract»

• ### Encoding and Decoding Binary Product Lattices

Publication Year: 2006, Page(s):5485 - 5495
| |PDF (359 KB) | HTML

A binary product lattice is generated from two binary component lattices of lower dimensions by employing the Kronecker product. This work focuses on codes carved from binary product lattices. Defined as such, an intriguing problem is that of effectively mapping independent data sequences onto a selected subset of lattice points. A novel approach is disclosed yielding an explicit connection betwee... View full abstract»

• ### Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the $q$-ary Random Deletion Channel for Large $q$

Publication Year: 2006, Page(s):5496 - 5501
Cited by:  Papers (7)
| |PDF (210 KB) | HTML

We demonstrate polynomial-time deletion codes based on the verification-based decoding paradigm that come arbitrarily close to capacity. The random deletion channel takes n symbols from a q-ary alphabet, and each symbol is deleted independently with probability p. Taking advantage of recent improvements on the results of Luby and Mitzenmacher for verification-based decoding by Shokrollahi and Wang... View full abstract»

• ### An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes

Publication Year: 2006, Page(s):5501 - 5509
Cited by:  Papers (9)
| |PDF (421 KB) | HTML

This correspondence presents an upper bound on the minimum distance of serially concatenated codes with interleaver where the inner code is a systematic recursive convolutional encoder and the outer code is any convolutional encoder. The resulting expression shows that the minimum distance of the concatenated code cannot grow more than O(K1-1/df (O)), where K is th... 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