Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

IEEE Transactions on Information Theory

Volume 52 Issue 1 • Jan. 2006

Filter Results

Displaying Results 1 - 25 of 40
  • Table of contents

    Publication Year: 2006, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory list of associate editors

    Publication Year: 2006, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • 2005 Information Theory Society Paper Award

    Publication Year: 2006, Page(s):2 - 3
    Request permission for commercial reuse | PDF file iconPDF (358 KB) | HTML iconHTML
    Freely Available from IEEE
  • 2005 IEEE Communications Society and Information Theory Society Joint Paper Award

    Publication Year: 2006, Page(s):4 - 5
    Request permission for commercial reuse | PDF file iconPDF (387 KB)
    Freely Available from IEEE
  • Stable recovery of sparse overcomplete representations in the presence of noise

    Publication Year: 2006, Page(s):6 - 18
    Cited by:  Papers (950)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in general, the problem of finding sparse representations must be unstable in the presence of noise. This paper establishes the possibility of stable recovery under a combination of sufficient sparsity and favorable structure ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimality of symbol-by-symbol filtering and denoising

    Publication Year: 2006, Page(s):19 - 40
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    We consider the problem of optimally recovering a finite-alphabet discrete-time stochastic process {Xt} from its noise-corrupted observation process {Zt}. In general, the optimal estimate of Xt will depend on all the components of {Zt} on which it can be based. We characterize nontrivial situations (i.e., beyond the case where (Xt,Zt View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of the maximum a posteriori path estimator in hidden Markov models

    Publication Year: 2006, Page(s):41 - 51
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    A hidden Markov model (HMM) consists of a nonobservable Markov chain X=(X0,X1,...) and a measured process Y=(Y 0,Y1,...) whose distribution is determined by X. To estimate the hidden path of X up to time n,X0,X1,...,Xn, by the observations Y 0,Y1,...,Yn, usually the maximum a posteriori pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency in models for distributed learning under communication constraints

    Publication Year: 2006, Page(s):52 - 63
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Motivated by sensor networks and other distributed settings, several models for distributed learning are presented. The models differ from classical works in statistical pattern recognition by allocating observations of an independent and identically distributed (i.i.d.) sampling process among members of a network of simple learning agents. The agents are limited in their ability to communicate to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for the optical channel: the ghost-pulse constraint

    Publication Year: 2006, Page(s):64 - 77
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    We consider a number of constrained coding techniques that can be used to mitigate a nonlinear effect in the optical fiber channel that causes the formation of spurious pulses, called "ghost pulses". Specifically, if b1b2...bn is a sequence of bits sent across an optical channel, such that bk=bl=bm=1 for some k,l,m (not necessarily ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance properties of expander codes

    Publication Year: 2006, Page(s):78 - 90
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    The minimum distance of some families of expander codes is studied, as well as some related families of codes defined on bipartite graphs. The weight spectrum and the minimum distance of a random ensemble of such codes are computed and it is shown that it sometimes meets the Gilbert-Varshamov (GV) bound. A lower bound on the minimum distances of constructive families of expander codes is derived. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coded modulation in the block-fading channel: coding theorems and code construction

    Publication Year: 2006, Page(s):91 - 114
    Cited by:  Papers (112)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1391 KB) | HTML iconHTML

    We consider coded modulation schemes for the block-fading channel. In the setting where a codeword spans a finite number N of fading degrees of freedom, we show that coded modulations of rate R bit per complex dimension, over a finite signal set χ⊆C of size 2M, achieve the optimal rate-diversity tradeoff given by the Singleton bound δ(N,M,R)=1+ View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new family of unitary space-time codes with a fast parallel sphere decoder algorithm

    Publication Year: 2006, Page(s):115 - 140
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (759 KB) | HTML iconHTML

    In this paper, we propose a new design criterion and a new class of unitary signal constellations for differential space-time modulation for multiple-antenna systems over Rayleigh flat-fading channels with unknown fading coefficients. Extensive simulations show that the new codes have significantly better performance than existing codes. We have compared the performance of our codes with different... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gradient of mutual information in linear vector Gaussian channels

    Publication Year: 2006, Page(s):141 - 154
    Cited by:  Papers (185)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    This paper considers a general linear vector Gaussian channel with arbitrary signaling and pursues two closely related goals: i) closed-form expressions for the gradient of the mutual information with respect to arbitrary parameters of the system, and ii) fundamental connections between information theory and estimation theory. Generalizing the fundamental relationship recently unveiled by Guo, Sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network information flow with correlated sources

    Publication Year: 2006, Page(s):155 - 170
    Cited by:  Papers (91)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    Consider the following network communication setup, originating in a sensor networking application we refer to as the "sensor reachback" problem. We have a directed graph G=(V,E), where V={v0v1...vn} and E⊆V×V. If (vi,vj)∈E, then node i can send messages to node j over a discrete memoryless channel (DMC) (Xij,pi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On universal types

    Publication Year: 2006, Page(s):171 - 189
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB) | HTML iconHTML

    The universal type class of a sequence xn is defined, in analogy to the notion underlying the classical method of types. Two sequences of the same length are said to be of the same universal (LZ) type if and only if they yield the same dictionary (or, equivalently, parsing tree) in the incremental parsing of Ziv and Lempel (1978). It is shown that for any finite order k, the variational... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On joint coding for watermarking and encryption

    Publication Year: 2006, Page(s):190 - 205
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (418 KB) | HTML iconHTML

    In continuation of earlier work, where the problem of joint information embedding and lossless compression (of the composite signal) was studied in the absence and in the presence of attacks, here we consider the additional ingredient of protecting the secrecy of the watermark against an unauthorized party, which has no access to a secret key shared by the legitimate parties. In other words, we st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secret sharing schemes from three classes of linear codes

    Publication Year: 2006, Page(s):206 - 212
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    Secret sharing has been a subject of study for over 20 years, and has had a number of real-world applications. There are several approaches to the construction of secret sharing schemes. One of them is based on coding theory. In principle, every linear code can be used to construct secret sharing schemes. But determining the access structure is very hard as this requires the complete characterizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On causal and semicausal codes for joint information embedding and source coding

    Publication Year: 2006, Page(s):213 - 226
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    A source of random message bits is to be embedded into a covertext modeled as a discrete memoryless source (DMS), resulting in a stegotext from which the embedded bits should be recoverable. A causal code for such a scenario consists of an encoder that generates the stegotext as a causal function of the message bits and the covertext, and a decoder that reproduces the message bits as a causal func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the symmetric information rate of two-dimensional finite-state ISI channels

    Publication Year: 2006, Page(s):227 - 236
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    We derive a pair of bounds (upper and lower) on the symmetric information rate of a two-dimensional finite-state intersymbol interference (ISI) channel model. For channels with small impulse response support, they can be estimated via a modified forward recursion of the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. The convergence of the bounds is also analyzed. To relax the constraint on the size of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Piecewise linear conditional information inequality

    Publication Year: 2006, Page(s):236 - 238
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB) | HTML iconHTML

    A new information inequality of non-Shannon type is proved for three discrete random variables under conditional independence constraints, using the framework of entropy functions and polymatroids. Tightness of the inequality is described via quasi-groups View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On minimizing distortion and relative entropy

    Publication Year: 2006, Page(s):238 - 245
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    A common approach for estimating a probability mass function w when given a prior q and moment constraints given by Aw≤b is to minimize the relative entropy between w and q subject to the set of linear constraints. In such cases, the solution w is known to have exponential form. We consider the case in which the linear constraints are noisy, uncertain, infeasible, or otherwise "soft." A solutio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error exponents for finite-hypothesis channel identification

    Publication Year: 2006, Page(s):245 - 255
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB) | HTML iconHTML

    We consider the problem of designing optimal probing signals for finite-hypothesis testing. Equivalently, we cast the problem as the design of optimal channel input sequences for identifying a discrete channel under observation from a finite set of known channels. The optimality criterion that we employ is the exponent of the Bayesian probability of error. In our study, we consider a feedforward s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the exponential convergence of matching pursuits in quasi-incoherent dictionaries

    Publication Year: 2006, Page(s):255 - 261
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    The purpose of this correspondence is to extend results by Villemoes and Temlyakov about exponential convergence of Matching Pursuit (MP) with some structured dictionaries for "simple" functions in finite or infinite dimension. The results are based on an extension of Tropp's results about Orthogonal Matching Pursuit (OMP) in finite dimension, with the observation that it does not only work for OM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error probability analysis of bit-interleaved coded modulation

    Publication Year: 2006, Page(s):262 - 271
    Cited by:  Papers (93)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    This correspondence presents a simple method to accurately compute the error probability of bit-interleaved coded modulation (BICM). Thanks to the binary-input output-symmetric (BIOS) nature of the channel, the pairwise error probability (PEP) is equal to the tail probability of a sum of random variables with a particular distribution. This probability is in turn computed with a saddlepoint approx... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

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