IEEE Transactions on Information Theory

Volume 50 Issue 4 • April 2004

Filter Results

Displaying Results 1 - 21 of 21
  • Table of contents

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

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • A tight signal-band power bound on mismatch noise in a mismatch-shaping digital-to-analog converter

    Publication Year: 2004, Page(s):593 - 607
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    Many applications employ digital-to-analog converters (DACs) to obtain the advantages of digital processing (e.g., low power and physical size, resilience to noise, etc.) to generate signals, such as voltages, that are analog in nature. Given the appropriate numerical representation of its input, the DAC ideally behaves as a linear gain element. However, as a result of inevitable component mismatc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suboptimality of TDMA in the low-power regime

    Publication Year: 2004, Page(s):608 - 620
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    We consider multiaccess, broadcast, and interference channels with additive Gaussian noise. Although the set of rate pairs achievable by time-division multiple access (TDMA) is not equal to the capacity region, the TDMA achievable region converges to the capacity region as the power decreases. Furthermore, TDMA achieves the optimum minimum energy per bit. Despite those features, this paper shows t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound on mean-square estimation error with background parameter mismatch

    Publication Year: 2004, Page(s):621 - 632
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    In typical parameter estimation problems, the signal observation is a function of the parameter set to be estimated as well as some background (environmental/system) parameters assumed known. The assumed background could differ from the true one, leading to biased estimates even at high signal-to-noise ratio (SNR). To analyze this background mismatch problem, a Ziv-Zakai-type lower bound on the me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounding the average length of optimal source codes via majorization theory

    Publication Year: 2004, Page(s):633 - 637
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    We consider the problem of bounding the average length of an optimal (Huffman) source code when only limited knowledge of the source symbol probability distribution is available. For instance, we provide tight upper and lower bounds on the average length of optimal source codes when only the largest or the smallest source symbol probability is known. Our results rely on basic results of majorizati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fisher information with respect to cumulants

    Publication Year: 2004, Page(s):638 - 642
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Fisher information is a measure of the best precision with which a parameter can be estimated from statistical data. It can also be defined for a continuous random variable without reference to any parameters, in which case it has a physically compelling interpretation of representing the highest precision with which the first cumulant of the random variable, i.e., its mean, can be estimated from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extrinsic Kalman filter for iterative multiuser decoding

    Publication Year: 2004, Page(s):642 - 648
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    One powerful approach for multiuser decoding is to iterate between a linear multiuser filter (which ignores coding constraints) and individual decoders (which ignore multiple-access interference). Subject to clearly formulated statistical assumptions and the history of input signals provided by the outer decoders over all previous iterations, an extrinsic Kalman filter is suggested. This approach ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of write-unidirectional memories with nonperiodic codes

    Publication Year: 2004, Page(s):649 - 656
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Write-unidirectional memories (WUMs) were introduced by Willems, Vinck, and Borden as an information-theoretic model for storing and updating information on a rewritable medium with the writing constraints: During the odd (resp., even) cycles of updating information, the encoder can only write 1's (resp., 0's) in selected bit positions of WUMs, and not change the contents of other positions. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outage mutual information of space-time MIMO channels

    Publication Year: 2004, Page(s):657 - 662
    Cited by:  Papers (88)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    We derive analytical expressions for the probability density function (pdf) of the random mutual information between transmitted and received vector signals of a random space-time independent and identically distributed (i.i.d.) multiple-input multiple-output (MIMO) channel, assuming that the transmitted signals from the multiple antennas are Gaussian i.i.d.. We show that this pdf can be well appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Csisza´r's cutoff rates for the general hypothesis testing problem

    Publication Year: 2004, Page(s):663 - 678
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB) | HTML iconHTML

    In , Csisza´r established the concept of forward β-cutoff rate for the error exponent hypothesis testing problem based on independent and identically distributed (i.i.d.) observations. Given β0≥0 that provides the best possible lower bound in the form β(E-R0) to the type 1 error exponent func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • List decoding of q-ary Reed-Muller codes

    Publication Year: 2004, Page(s):679 - 682
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    The q-ary Reed-Muller (RM) codes RMq(u,m) of length n=qm are a generalization of Reed-Solomon (RS) codes, which use polynomials in m variables to encode messages through functional encoding. Using an idea of reducing the multivariate case to the univariate case, randomized list-decoding algorithms for RM codes were given in and . The algorithm in Sudan et al. (1999) is an imp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized rational interpolation over commutative rings and remainder decoding

    Publication Year: 2004, Page(s):683 - 690
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    We propose a new decoding procedure for Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes over Zm where m is a product of prime powers. Our method generalizes the remainder decoding technique for RS codes originally introduced by Welch and Berlekamp and retains its key feature of not requiring the prior evaluation of syndromes. It thus represents a significant departure from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Affine invariant extended cyclic codes over Galois rings

    Publication Year: 2004, Page(s):691 - 698
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Recently, Blackford and Ray-Chaudhuri used transform domain techniques to permutation groups of cyclic codes over Galois rings. They used the same technique to find a set of necessary and sufficient conditions for extended cyclic codes of length 2m over any subring of GR(4,m) to be affine invariant. Here, we use the same technique to find a set of necessary and sufficient conditions for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on nonlinear Xing codes

    Publication Year: 2004, Page(s):699 - 700
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Nonlinear Xing codes are considered. It is shown that Xing codes of length p-1 (where p is a prime) are subcodes of cosets of Reed-Solomon codes whose minimum distance equals Xing's lower bound on the minimum distance. This provides a straightforward proof for the lower bound on the minimum distance of the codes. The alphabet size of Xing codes is restricted not to be larger than the characteristi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalization of Niederreiter-Xing's propagation rule and its commutativity with duality

    Publication Year: 2004, Page(s):701 - 702
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB) | HTML iconHTML

    Niederreiter and Xing (2000) recently proposed a propagation rule for linear codes.Özbudak and Stichtenoth showed that the Niederreiter-Xing construction is a particular construction of a matrix-product code. Cheng, Cheng, and Sun analyzed the case when Niederreiter-Xing rule commutes with duality. The aim of this correspondence is to generalize the propagation rule to a wider class of codes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New algebraic constructions of rotated Zn-lattice constellations for the Rayleigh fading channel

    Publication Year: 2004, Page(s):702 - 714
    Cited by:  Papers (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    In this correspondence, we present various families of full diversity rotated Zn-lattice constellations based on algebraic number theory constructions. We are able to give closed-form expressions of their minimum product distance using the corresponding algebraic properties. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized self-shrinking generator

    Publication Year: 2004, Page(s):714 - 719
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    In this correspondence, we present a simple bit-stream generator. It is a specialization of shrinking generator and a generalization of self-shrinking generator. We call it "generalized self-shrinking generator." The family of such generated sequences has a group structure. The correlation between the sequences is quite good and the sequences themselves are balanced. For each k, 0 View full abstract»

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

    Publication Year: 2004, Page(s):720 - 724
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory information for authors

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (23 KB) | HTML iconHTML
    Freely Available from IEEE
  • Blank page [back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (2 KB)
    Freely Available from IEEE

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