Scheduled System Maintenance
On Tuesday, January 23, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 1 • Jan. 2005

Filter Results

Displaying Results 1 - 25 of 51
  • Table of Contents

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

    Publication Year: 2005, 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: 2005, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • 2004 IEEE Information Theory Society Paper Award

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

    Publication Year: 2005, Page(s): 4
    Request permission for commercial reuse | PDF file iconPDF (253 KB) | HTML iconHTML
    Freely Available from IEEE
  • Universal discrete denoising: known channel

    Publication Year: 2005, Page(s):5 - 28
    Cited by:  Papers (117)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4652 KB) | HTML iconHTML

    A discrete denoising algorithm estimates the input sequence to a discrete memoryless channel (DMC) based on the observation of the entire output sequence. For the case in which the DMC is known and the quality of the reconstruction is evaluated with a given single-letter fidelity criterion, we propose a discrete denoising algorithm that does not assume knowledge of statistical properties of the in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of MIMO relay channels

    Publication Year: 2005, Page(s):29 - 43
    Cited by:  Papers (597)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB) | HTML iconHTML

    We study the capacity of multiple-input multiple- output (MIMO) relay channels. We first consider the Gaussian MIMO relay channel with fixed channel conditions, and derive upper bounds and lower bounds that can be obtained numerically by convex programming. We present algorithms to compute the bounds. Next, we generalize the study to the Rayleigh fading case. We find an upper bound and a lower bou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The private classical capacity and quantum capacity of a quantum channel

    Publication Year: 2005, Page(s):44 - 55
    Cited by:  Papers (307)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward public classical communication. Motivated by the work of Schumacher and Westmoreland on quantum privacy and quantum coherence, parallels between private classical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remote preparation of quantum states

    Publication Year: 2005, Page(s):56 - 74
    Cited by:  Papers (84)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The existence of quantum entanglement catalysts

    Publication Year: 2005, Page(s):75 - 80
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio (Phys. Rev. Lett., vol. 83, p. 3566, 1999) presented an interesting example showing that the presence of another state, called a catalyst, enables such a transformation without changing the catalyst. They also poin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic analysis of turbo decoding

    Publication Year: 2005, Page(s):81 - 100
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB) | HTML iconHTML

    This paper proposes a stochastic framework for dynamic modeling and analysis of turbo decoding. By modeling the input and output signals of a turbo decoder as random processes, we prove that these signals become ergodic when the block size of the code becomes very large. This basic result allows us to easily model and compute the statistics of the signals in a turbo decoder. Using the ergodicity r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleavers for turbo codes using permutation polynomials over integer rings

    Publication Year: 2005, Page(s):101 - 119
    Cited by:  Papers (142)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (650 KB) | HTML iconHTML

    A class of deterministic interleavers for turbo codes (TCs) based on permutation polynomials over ZN is introduced. The main characteristic of this class of interleavers is that they can be algebraically designed to fit a given component code. Moreover, since the interleaver can be generated by a few simple computations, storage of the interleaver tables can be avoided. By using the per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Verification-based decoding for packet-based low-density parity-check codes

    Publication Year: 2005, Page(s):120 - 127
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    We introduce and analyze verification-based decoding for low-density parity-check (LDPC) codes, an approach specifically designed to manipulate data in packet-sized units. Verification-based decoding requires only linear time for both encoding and decoding and succeeds with high probability under random errors. We describe how to utilize code scrambling to extend our results to channels with error... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency of support vector machines and other regularized kernel classifiers

    Publication Year: 2005, Page(s):128 - 142
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB) | HTML iconHTML

    It is shown that various classifiers that are based on minimization of a regularized risk are universally consistent, i.e., they can asymptotically learn in every classification task. The role of the loss functions used in these algorithms is considered in detail. As an application of our general framework, several types of support vector machines (SVMs) as well as regularization networks are trea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional importance sampling estimators

    Publication Year: 2005, Page(s):143 - 153
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (318 KB) | HTML iconHTML

    We give a unified presentation of the conditional importance sampling estimators. We show that they are always better than their nonconditional counterparts. We then present the large deviation theory associated with these estimators. In particular, we give conditional simulation distributions that are optimal in the sense that they are efficient. Interestingly enough, these distributions will not... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection

    Publication Year: 2005, Page(s):154 - 172
    Cited by:  Papers (140)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (630 KB) | HTML iconHTML

    In multiple-input multiple-output (MIMO) multiuser detection theory, the QR decomposition of the channel matrix H can be used to form the back-cancellation detector. In this paper, we propose an optimal QR decomposition, which we call the equal-diagonal QR decomposition, or briefly the QRS decomposition. We apply the decomposition to precoded successive-cancellation detection, where we assume that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels

    Publication Year: 2005, Page(s):173 - 187
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    A framework is presented that allows a number of known results relating feedback equalization, linear prediction, and mutual information to be easily understood. A lossless, additive decomposition of mutual information in a general class of Gaussian channels is introduced and shown to produce an information-preserving canonical decision-feedback receiver. The approach is applied to intersymbol int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing structured tight frames via an alternating projection method

    Publication Year: 2005, Page(s):188 - 209
    Cited by:  Papers (192)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (501 KB) | HTML iconHTML

    Tight frames, also known as general Welch-bound- equality sequences, generalize orthonormal systems. Numerous applications - including communications, coding, and sparse approximation- require finite-dimensional tight frames that possess additional structural properties. This paper proposes an alternating projection method that is versatile enough to solve a huge class of inverse eigenvalue proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding approaches to fault tolerance in linear dynamic systems

    Publication Year: 2005, Page(s):210 - 228
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    This paper discusses fault tolerance in discrete-time dynamic systems, such as finite-state controllers or computer simulations, with focus on the use of coding techniques to efficiently provide fault tolerance to linear finite-state machines (LFSMs). Unlike traditional fault tolerance schemes, which rely heavily-particularly for dynamic systems operating over extended time horizons-on the assumpt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full-rate full-diversity space-frequency codes with optimum coding advantage

    Publication Year: 2005, Page(s):229 - 249
    Cited by:  Papers (166)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB) | HTML iconHTML

    A general space-frequency (SF) block code structure is proposed that can guarantee full-rate (one channel symbol per subcarrier) and full-diversity transmission in multiple-input multiple-output-orthogonal frequency-division multiplexing (MIMO-OFDM) systems. The proposed method can be used to construct SF codes for an arbitrary number of transmit antennas, any memoryless modulation and arbitrary p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on distance distributions in codes of known size

    Publication Year: 2005, Page(s):250 - 258
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    We treat the problem of bounding components of the possible distance distributions of codes given the knowledge of their size and possibly minimum distance. Using the Beckner inequality from harmonic analysis, we derive upper bounds on distance distribution components which are sometimes better than earlier ones due to Ashikhmin, Barg, and Litsyn. We use an alternative approach to derive upper bou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Goppa geometric codes achieving the Gilbert-Varshamov bound

    Publication Year: 2005, Page(s):259 - 264
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (191 KB) | HTML iconHTML

    Based on s-zeta-functions of curves over finite fields, we show that Goppa geometry codes achieve the q-ary Gilbert-Varshamov bound for all prime powers q (including q=2) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding

    Publication Year: 2005, Page(s):265 - 280
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB) | HTML iconHTML

    This paper deals with the linear-programming-based decoding algorithm of Feldman and Karger for repeat-accumulate "turbo-like" codes. We present a new structural characterization that captures the event that decoding fails. Based on this structural characterization, we develop polynomial algorithms that, given an RA(2) code, compute upper and lower bounds on the word error probability Pw View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • p-Adic valuation of weights in Abelian codes over Z(pd)

    Publication Year: 2005, Page(s):281 - 305
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (659 KB) | HTML iconHTML

    Counting polynomial techniques introduced by Wilson are used to provide analogs of a theorem of McEliece. McEliece's original theorem relates the greatest power of p dividing the Hamming weights of words in cyclic codes over GF (p) to the length of the smallest unity-product sequence of nonzeroes of the code. Calderbank, Li, and Poonen presented analogs for cyclic codes over Zopf(2d) us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection and estimation of improper complex random signals

    Publication Year: 2005, Page(s):306 - 312
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    Nonstationary complex random signals are in general improper (not circularly symmetric), which means that their complementary covariance is nonzero. Since the Karhunen-Loeve (K-L) expansion in its known form is only valid for proper processes, we derive the improper version of this expansion. It produces two sets of eigenvalues and improper observable coordinates. We then use the K-L expansion to ... 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