IEEE Transactions on Information Theory

Issue 12 • Dec. 2002

Filter Results

Displaying Results 1 - 17 of 17
  • Contributors

    Publication Year: 2002, Page(s):3151 - 3154
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2002, Page(s):3155 - 3174
    Request permission for commercial reuse | PDF file iconPDF (338 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 2002, Page(s):3174 - 3231
    Request permission for commercial reuse | PDF file iconPDF (620 KB)
    Freely Available from IEEE
  • Capacity of multiple-transmit multiple-receive antenna architectures

    Publication Year: 2002, Page(s):3117 - 3128
    Cited by:  Papers (117)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    The capacity of wireless communication architectures equipped with multiple transmit and receive antennas and impaired by both noise and cochannel interference is studied. We find a closed-form solution for the capacity in the limit of a large number of antennas. This asymptotic solution, which is a sole function of the relative number of transmit and receive antennas and the signal-to-noise and s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Existence and construction of noncoherent unitary space-time codes

    Publication Year: 2002, Page(s):3112 - 3117
    Cited by:  Papers (60)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (342 KB) | HTML iconHTML

    We consider transmission using N transmit and reception using M receive antennas in a wireless environment assuming that neither the transmitter nor the receiver knows the channel coefficients. For the scenario that the transmission employs noncoherent T × N unitary space-time codes and for a block-fading channel model where the channel is static during T channel uses and varies from T chann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The MMD codes are proper for error detection

    Publication Year: 2002, Page(s):3109 - 3111
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (241 KB) | HTML iconHTML

    The undetected error probability of a linear code used to detect errors on a symmetric channel is a function of the symbol error probability ε of the channel and involves the weight distribution of the code. The code is proper, if the undetected error probability increases monotonously in ε. Proper codes are generally considered to perform well in error detection. We show in this corresp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on self-dual group codes

    Publication Year: 2002, Page(s):3107 - 3109
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    We classify group algebras over Galois rings containing self-dual ideals; i.e., ideals C which satisfy C = C with respect to the natural nondegenerate bilinear form given on group algebras. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A PAC-Bayesian margin bound for linear classifiers

    Publication Year: 2002, Page(s):3140 - 3150
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB) | HTML iconHTML

    We present a bound on the generalization error of linear classifiers in terms of a refined margin quantity on the training sample. The result is obtained in a probably approximately correct (PAC)-Bayesian framework and is based on geometrical arguments in the space of linear classifiers. The new bound constitutes an exponential improvement of the so far tightest margin bound, which was developed i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability-based soft-decision decoding with iterative information set reduction

    Publication Year: 2002, Page(s):3101 - 3106
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    The reliability-based decoding approach using the reprocessing of the most reliable information set only is extended into the iterative reprocessing of several information sets. At the end of each information set reprocessing, some information bits are delivered by the decoder. Consequently, information sets with decreasing cardinality values are considered at each iteration. A tight upper bound o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Zador-like formula for quantizers based on periodic tilings

    Publication Year: 2002, Page(s):3138 - 3140
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (241 KB) | HTML iconHTML

    We consider Zador's (1963, 1966, 1982) asymptotic formula for the distortion-rate function for a variable-rate vector quantizer in the high-rate case. This formula involves the differential entropy of the source, the rate of the quantizer in bits per sample, and a coefficient G which depends on the geometry of the quantizer but is independent of the source. We give an explicit formula for G in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A low-rate bound on the reliability of a quantum discrete memoryless channel

    Publication Year: 2002, Page(s):3096 - 3100
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (375 KB) | HTML iconHTML

    We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rank criterion for QAM space-time codes

    Publication Year: 2002, Page(s):3062 - 3079
    Cited by:  Papers (33)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1055 KB) | HTML iconHTML

    Space-time coding has been studied extensively as a powerful error correction coding for systems with multiple transmit antennas. An important design goal is to maximize the level of space diversity that a code can achieve. Toward this goal, the only systematic algebraic coding theory so far is binary rank theory by Hammons and El Gamal (see ibid. vol. 46, p.524-42, 2000) for binary phase-shift ke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variations on the Gallager bounds, connections, and applications

    Publication Year: 2002, Page(s):3029 - 3051
    Cited by:  Papers (83)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1495 KB) | HTML iconHTML

    There has been renewed interest in deriving tight bounds on the error performance of specific codes and ensembles, based on their distance spectrum. We discuss many reported upper bounds on the maximum-likelihood (ML) decoding error probability and demonstrate the underlying connections that exist between them. In addressing the Gallager bounds and their variations, we focus on the Duman and Saleh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MMSE detection in asynchronous CDMA systems: an equivalence result

    Publication Year: 2002, Page(s):3128 - 3137
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB) | HTML iconHTML

    The analysis of linear minimum mean-square error (MMSE) detection in a band-limited code-division multiple-access (CDMA) system that employs random spreading sequences is considered. The key features of the analysis are that the users are allowed to be completely asynchronous, and that the chip waveform is assumed to be the ideal Nyquist sinc function. It is shown that the asymptotic signal-to-int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic normality of linear multiuser receiver outputs

    Publication Year: 2002, Page(s):3080 - 3095
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB) | HTML iconHTML

    This paper proves large-system asymptotic normality of the output of a family of linear multiuser receivers that can be arbitrarily well approximated by polynomial receivers. This family of receivers encompasses the single-user matched filter, the decorrelator, the minimum mean square error (MMSE) receiver, the parallel interference cancelers, and many other linear receivers of interest. Both with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic input-output weight distributions and thresholds of convolutional and turbo-like encoders

    Publication Year: 2002, Page(s):3052 - 3061
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1023 KB) | HTML iconHTML

    We present a general method for computing the asymptotic input-output weight distribution of convolutional encoders. In some instances, one can derive explicit analytic expressions. In general, though, to determine the growth rate of the input-output weight distribution for a particular normalized input weight κ and output weight ω, a system of polynomial equations has to be solved. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity-achieving sequences for the erasure channel

    Publication Year: 2002, Page(s):3017 - 3028
    Cited by:  Papers (127)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB) | HTML iconHTML

    This paper starts a systematic study of capacity-achieving (c.a.) sequences of low-density parity-check codes for the erasure channel. We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes. We show various properties of this class which help us to construct new distributions from old ones. We then study certain types of capacity-achieving... 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