IEEE Transactions on Information Theory

Issue 4 • April 2006

Filter Results

Displaying Results 1 - 25 of 50
  • Table of contents

    Publication Year: 2006, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (44 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
  • Compressed sensing

    Publication Year: 2006, Page(s):1289 - 1306
    Cited by:  Papers (9216)  |  Patents (143)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB) | HTML iconHTML

    Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements n can be dramatically smaller than the size m. Thus, certain natural classes of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-theoretic upper and lower bounds for statistical estimation

    Publication Year: 2006, Page(s):1307 - 1321
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    In this paper, we establish upper and lower bounds for some statistical estimation problems through concise information-theoretic arguments. Our upper bound analysis is based on a simple yet general inequality which we call the information exponential inequality. We show that this inequality naturally leads to a general randomized estimation method, for which performance upper bounds can be obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovering convex edges of an image from noisy tomographic data

    Publication Year: 2006, Page(s):1322 - 1334
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1992 KB) | HTML iconHTML

    We consider the problem of recovering edges of an image from noisy tomographic data. The original image is assumed to have a discontinuity jump (edge) along the boundary of a compact convex set. The Radon transform of the image is observed with noise, and the problem is to estimate the edge. We develop an estimation procedure which is based on recovering the support function of the edge. It is sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax-optimal classification with dyadic decision trees

    Publication Year: 2006, Page(s):1335 - 1353
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    Decision trees are among the most popular types of classifiers, with interpretability and ease of implementation being among their chief attributes. Despite the widespread use of decision trees, theoretical analysis of their performance has only begun to emerge in recent years. In this paper, it is shown that a new family of decision trees, dyadic decision trees (DDTs), attain nearly optimal (in a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neyman-pearson detection of gauss-Markov signals in noise: closed-form error exponentand properties

    Publication Year: 2006, Page(s):1354 - 1365
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    The performance of Neyman-Pearson detection of correlated random signals using noisy observations is considered. Using the large deviations principle, the performance is analyzed via the error exponent for the miss probability with a fixed false-alarm probability. Using the state-space structure of the signal and observation model, a closed-form expression for the error exponent is derived using t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear dynamics of iterative decoding systems: analysis and applications

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

    Iterative decoding algorithms may be viewed as high-dimensional nonlinear dynamical systems, depending on a large number of parameters. In this work, we introduce a simplified description of several iterative decoding algorithms in terms of the a posteriori average entropy, and study them as a function of a single parameter that closely approximates the signal-to-noise ratio (SNR). Using this appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "Turbo DPSK" using soft multiple-symbol differential sphere decoding

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

    Coded interleaved differential M-ary phase-shift keying (M-DPSK) with iterative decoding, the so-called "Turbo DPSK," is known as a power-efficient transmission format. Due to the rotational invariance of DPSK, it particularly enables detection without channel state information (CSI). However, the soft-input soft-output (SISO) component decoder for DPSK is the computational bottleneck if performan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification of minimum-redundancy prefix codes

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

    We show that verifying a given prefix code for optimality requires Ω(nlogn) time, indicating that the verification problem is not asymptotically easier than the construction problem. Alternatively, we give linear-time verification algorithms for several special cases that are either typical in practice or theoretically interesting. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable channel regions for good binary codes transmitted over parallel channels

    Publication Year: 2006, Page(s):1405 - 1424
    Cited by:  Papers (33)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB) | HTML iconHTML

    We study the average error probability performance of binary linear code ensembles when each codeword is divided into J subcodewords with each being transmitted over one of J parallel channels. This model is widely accepted for a number of important practical channels and signaling schemes including block-fading channels, incremental redundancy retransmission schemes, and multicarrier communicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tradeoff functions for constrained systems with unconstrained positions

    Publication Year: 2006, Page(s):1425 - 1449
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB) | HTML iconHTML

    We introduce a new method for analyzing and constructing combined modulation and error-correcting codes (ECCs), in particular codes that utilize some form of reverse concatenation and whose ECC decoding scheme requires easy access to soft information. We expand the work of Immink and Wijngaarden and also of Campello, Marcus, New, and Wilson, in which certain bit positions in the modulation code ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the joint source-channel coding error exponent for discrete memoryless systems

    Publication Year: 2006, Page(s):1450 - 1468
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (666 KB) | HTML iconHTML

    We investigate the computation of Csisza´r's bounds for the joint source-channel coding (JSCC) error exponent EJ of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slepian-Wolf coding over broadcast channels

    Publication Year: 2006, Page(s):1469 - 1482
    Cited by:  Papers (98)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    We discuss reliable transmission of a discrete memoryless source over a discrete memoryless broadcast channel, where each receiver has side information (of arbitrary quality) about the source unknown to the sender. When there are K=2 receivers, the optimum coding strategy using separate and stand-alone source and channel codes is to build two independent binning structures and send bin indices usi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-way successively refined joint source-channel coding

    Publication Year: 2006, Page(s):1483 - 1494
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Consider a source, {Xi,Yi}i=1∞, producing independent copies of a pair of jointly distributed random variables (RVs). The {Xi} part of the process is observed at some location, say A, and is supposed to be reproduced at a different location, say B, where the {Yi} part of the process is observed. Similarly, {Yi} shou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On code design for the Slepian-Wolf problem and lossless multiterminal networks

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

    A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources using a single channel code that can achieve arbitrary rate allocation among encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we address the problem of practical code design for general multiterminal lossless networks where multiple memoryless correlated binary sources are separat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multicast tree structure and the power law

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

    In this paper, we investigate structural properties of multicast trees that give rise to the so-called multicast power law. The law asserts that the ratio R(n) of the average number of links in a multicast tree connecting the source to n destinations to the average number of links in a unicast path, satisfies asymptotically R(n)≈cnφ, 0<φ<1. In order to obtain a better insi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity bounds for Cooperative diversity

    Publication Year: 2006, Page(s):1522 - 1544
    Cited by:  Papers (222)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (723 KB) | HTML iconHTML

    In a cooperative diversity network, users cooperate to transmit each others' messages; to some extent nodes therefore collectively act as an antenna array and create a virtual or distributed multiple-input multiple-output (MIMO) system. In this paper, upper and lower bounds for the information-theoretic capacity of four-node ad hoc networks with two transmitters and two receivers using cooperative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on capacity and minimum energy-per-bit for AWGN relay channels

    Publication Year: 2006, Page(s):1545 - 1561
    Cited by:  Papers (192)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (515 KB) | HTML iconHTML

    Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for the general AWGN model and are tight onl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel

    Publication Year: 2006, Page(s):1562 - 1575
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    Several nonasymptotic formulas are established in channel resolvability and identification capacity, and they are applied to the wiretap channel. By using these formulas, the epsi capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Degrees of freedom in some underspread MIMO fading channels

    Publication Year: 2006, Page(s):1576 - 1608
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB) | HTML iconHTML

    Consider a multiple-input multiple-output (MIMO) fading channel in which the fading process varies slowly over time. Assuming that neither the transmitter nor the receiver have knowledge of the fading process, do multiple transmit and receive antennas provide significant capacity improvements at high signal-to-noise ratio (SNR)? For regular fading processes, recent results show that capacity ultim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of accurate fractional Gaussian noise by filtering

    Publication Year: 2006, Page(s):1609 - 1623
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB) | HTML iconHTML

    This paper describes a method for generating long sample paths of accurate fractional Gaussian noise (fGn), the increment process of fractional Brownian motion (fBm). The method is based on a Wold decomposition in which fGn is expressed as the output of a finite impulse response filter with discrete white Gaussian noise as input. The form of the ideal filter is derived analytically in the continuo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new binary sequence family with low correlation and large size

    Publication Year: 2006, Page(s):1624 - 1636
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    For odd n=2l+1 and an integer ρ with 1≤ρ≤l, a new family So(ρ) of binary sequences of period 2n-1 is constructed. For a given ρ, So(ρ) has maximum correlation 1+2n+2ρ-12/, family size 2nρ, and maximum linear span n(n+1)/2. Similarly, a new family of Se(ρ) of binary sequences of period 2n View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross correlation of m-sequences of different lengths

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

    We consider the distribution of the cross correlation between m-sequences of period 2m-1, where m=2k and m-sequences of shorter period 2k-1. We present some general properties of the cross correlation between these m-sequences and we find some decimations with 3-valued cross correlation. We further present some numerical results and open problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pseudonoise sequences based on algebraic feedback shift registers

    Publication Year: 2006, Page(s):1649 - 1662
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    Over the past half century, various statistical properties of pseudorandom sequences have played important roles in a variety of applications. Among these properties are Golomb's randomness conditions: (R1) balance, (R2) run property, and (R3) ideal autocorrelations, as well as the closely related properties (R4) shift and add, and (R5) de Bruin (uniform distribution of subblocks). The purpose of ... 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