By Topic

IEEE Transactions on Information Theory

Issue 1 • Jan. 2004

Filter Results

Displaying Results 1 - 25 of 31
  • Table of contents

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

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

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

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

    Publication Year: 2004, Page(s):3 - 4
    Request permission for commercial reuse | PDF file iconPDF (130 KB) | HTML iconHTML
    Freely Available from IEEE
  • On universal simulation of information sources using training data

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

    We consider the problem of universal simulation of an unknown random process, or information source, of a certain parametric family, given a training sequence from that source and given a limited budget of purely random bits. The goal is to generate another random sequence (of the same length or shorter), whose probability law is identical to that of the given training sequence, but with minimum s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achievable key rates for universal simulation of random data with respect to a set of statistical tests

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

    We consider the problem of universal simulation of an unknown source from a certain parametric family of discrete memoryless sources, given a training vector X from that source and given a limited budget of purely random key bits. The goal is to generate a sequence of random vectors {Yi}, all of the same dimension and the same probability law as the given training vector X, such that a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity

    Publication Year: 2004, Page(s):31 - 46
    Cited by:  Papers (58)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product code, an interleaver, and a rate-1 recursive convolutional code. The proposed codes, termed product accumulate (PA) codes, are linear time encodable and linear time decodable. We show that the product code by itself does not have a positive threshold, but a PA code can prov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes

    Publication Year: 2004, Page(s):47 - 61
    Cited by:  Papers (75)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    In this two-part paper, we present a new achievable rate region for the general n-channel symmetric multiple descriptions problem. In part I, inspired by the concept of maximum-distance separable (MDS) erasure channel codes, we consider a special case of this rate region, where the source is encoded into n descriptions each with rate R. These descriptions are transmitted over n bandwidth constrain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantizers with uniform encoders and channel optimized decoders

    Publication Year: 2004, Page(s):62 - 77
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    Scalar quantizers with uniform encoders and channel optimized decoders are studied for uniform sources and binary symmetric channels. It is shown that the natural binary code (NBC) and folded binary code (FBC) induce point density functions that are uniform on proper subintervals of the source support, whereas the Gray code (GC) does not induce a point density function. The mean-squared errors (MS... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy and expected acceptance counts for finite automata

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

    If a sequence of independent unbiased random bits is fed into a finite automaton, it is straightforward to calculate the expected number of acceptances among the first n prefixes of the sequence. This paper deals with the situation in which the random bits are neither independent nor unbiased, but are nearly so. We show that, under suitable assumptions concerning the automaton, if the difference b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust least-squares estimation with a relative entropy constraint

    Publication Year: 2004, Page(s):89 - 104
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    Given a nominal statistical model, we consider the minimax estimation problem consisting of finding the best least-squares estimator for the least favorable statistical model within a neighborhood of the nominal model. The neighborhood is formed by placing a bound on the Kullback-Leibler (KL) divergence between the actual and nominal models. For a Gaussian nominal model and a finite observations i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power control and spreading sequence allocation in a CDMA forward link

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

    In this paper, we consider power control and sequence allocation to meet signal-to-interference ratio (SIR) targets for users in a code-division multiple-access (CDMA) forward link. Particular attention is given to the case when the number of users is larger than the spreading gain. Users in the system are classified into two classes, namely, overfaded users and nonoverfaded users, according to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay-bounded packet scheduling of bursty traffic over wireless channels

    Publication Year: 2004, Page(s):125 - 144
    Cited by:  Papers (110)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    In this paper, we study minimal power transmission of bursty sources over wireless channels with constraints on mean queuing delay. The power minimizing schedulers adapt power and rate of transmission based on the queue and channel state. We show that packet scheduling based on queue state can be used to trade queuing delay with transmission power, even on additive white Gaussian noise (AWGN) chan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative water-filling for Gaussian vector multiple-access channels

    Publication Year: 2004, Page(s):145 - 152
    Cited by:  Papers (538)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    This paper proposes an efficient numerical algorithm to compute the optimal input distribution that maximizes the sum capacity of a Gaussian multiple-access channel with vector inputs and a vector output. The numerical algorithm has an iterative water-filling interpretation. The algorithm converges from any starting point, and it reaches within 1/2 nats per user per output dimension from the sum c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximizing the spectral efficiency of coded CDMA under successive decoding

    Publication Year: 2004, Page(s):152 - 164
    Cited by:  Papers (29)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    We investigate the spectral efficiency achievable by random synchronous code-division multiple access (CDMA) with quaternary phase-shift keying (QPSK) modulation and binary error-control codes, in the large system limit where the number of users, the spreading factor, and the code block length go to infinity. For given codes, we maximize spectral efficiency assuming a minimum mean-square error (MM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple polynomial detectors for CDMA downlink transmissions on frequency-selective channels

    Publication Year: 2004, Page(s):164 - 171
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    In code-division multiple-access (CDMA) transmissions, computing the multiuser minimum mean-squared error (MMSE) detector coefficients requires the inversion of the covariance matrix associated to the received vector signal, an operation usually difficult to implement when the spreading factor and the number of users are large. It is therefore interesting to approximate the inverse by a matrix pol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of differential entropies

    Publication Year: 2004, Page(s):171 - 176
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    Calculation of the differential entropy of the limiting density of a sequence of probability density functions (pdf) is an interesting mathematical problem and is important in asymptotic analysis of communication systems. In such cases, it would be of interest to know if the limit of the differential entropies Hn, corresponding to the sequence of pdf fn, is equal to the diffe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information properties of order statistics and spacings

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

    We explore properties of the entropy, Kullback-Leibler information, and mutual information for order statistics. The probability integral transformation plays a pivotal role in developing our results. We provide bounds for the entropy of order statistics and some results that relate entropy ordering of order statistics to other well-known orderings of random variables. We show that the discriminat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources

    Publication Year: 2004, Page(s):183 - 193
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    Coding problems for correlated information sources were first investigated by Slepian and Wolf. They considered the data compression system, called the SW system, where two sequences emitted from correlated sources are separately encoded to codewords, and sent to a single decoder which has to output the original sequence pairs with a small probability or error. In this paper, we investigate the co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes over algebraic integer rings of cyclotomic fields

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

    Regarding any finite field as a residue field of the algebraic integer ring of a cyclotomic field, we select a system of representatives in the ring with minimal Manhattan metric, and introduce a Mannheim weight on the finite field. The linear codes over the finite field with the Mannheim weight are discussed. A geometric method to compute the representatives in Gaussian integers is provided. View full abstract»

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

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

    We generalize the notions of duadic codes, triadic codes, polyadic codes, and split group codes to include noncyclic Abelian codes. Necessary and sufficient conditions for the existence of such codes, and properties such as a duality property and a lower bound on the minimum weight of the subcode of "odd-like" codewords, are studied. This construction and its modification lead to many good codes, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extensive search for good punctured rate-k/(k+1) recursive convolutional codes for serially concatenated convolutional codes

    Publication Year: 2004, Page(s):208 - 217
    Cited by:  Papers (6)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB) | HTML iconHTML

    In many practical applications requiring variable-rate coding and/or high-rate coding for spectral efficiency, there is a need to employ high-rate convolutional codes (CC), either by themselves or in a parallel or serially concatenated scheme. For such applications, in order to keep the trellis complexity of the code constant and to permit the use of a simplified decoder that can accommodate multi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalization of some existence results on orthogonal designs for STBCs

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

    It is shown that two theorems regarding the existence of generalized linear processing orthogonal designs (GLPOD) are valid under more general conditions than those for which they have been stated and proved (for original paper see V. Tarokh et al., "Space-time block codes from orthogonal designs", ibid., vol. 45, p. 1456-1467 (1999)). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multisequence shift register synthesis over commutative rings with identity with applications to decoding cyclic codes over integer residue rings

    Publication Year: 2004, Page(s):220 - 229
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    We present a new algorithm for solving the multisequence shift register synthesis problem over a commutative ring R with identity. Given a finite set of R-sequences, each of length L, the complexity of our algorithm in terms of R-multiplications is O(L2) as L → ∞. An important application of this algorithm is in the decoding of cyclic codes over Zq up to the Hartma... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering