IEEE Transactions on Information Theory

Volume 49 Issue 2 • Feb. 2003

Filter Results

Displaying Results 1 - 20 of 20
  • Entropy and the timing capacity of discrete queues

    Publication Year: 2003, Page(s):357 - 370
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1011 KB) | HTML iconHTML

    Queueing systems which map Poisson input processes to Poisson output processes have been well-studied in classical queueing theory. This paper considers two discrete-time queues whose analogs in continuous-time possess the Poisson-in-Poisson-out property. It is shown that when packets arriving according to an arbitrary ergodic stationary arrival process are passed through these queueing systems, t... View full abstract»

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

    Publication Year: 2003, Page(s):371 - 381
    Cited by:  Papers (2029)  |  Patents (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB) | HTML iconHTML

    Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data befor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the undetected error probability for binary codes

    Publication Year: 2003, Page(s):382 - 390
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (809 KB) | HTML iconHTML

    In this paper, the undetected error probability for binary codes is studied. First complementary codes are studied. Next, a new proof of Abdel-Ghaffar's (1997) lower bound on the undetected error probability is presented and some generalizations are given. Further, upper and lower bounds on the undetected error probability for binary constant weight codes are given, and asymptotic versions are stu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bolt interleavers for turbo codes

    Publication Year: 2003, Page(s):391 - 400
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (866 KB) | HTML iconHTML

    A procedure is described to produce efficient turbo-code interleavers. It is well suited to the selection of interleavers that produce a large minimum distance for the resulting turbo codes. A feature of these interleavers is that the final state of the two elementary encoders is simultaneously zero. Examples are given and the corresponding codes are simulated. They seem to be among the best ones ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal space-time constellations from groups

    Publication Year: 2003, Page(s):401 - 410
    Cited by:  Papers (105)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (711 KB) | HTML iconHTML

    We consider the design of space-time constellations based on group codes for fading channels with multiple transmit and receive antennas. These codes can be viewed as multiantenna extensions of phase-shift keying (PSK), in the sense that all codewords have equal energy, all are rotations of a fixed codeword, and there is a simple differential transmission rule that allows data to be sent without c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized Levinson algorithm for covariance extension with application to multiscale autoregressive modeling

    Publication Year: 2003, Page(s):411 - 424
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (727 KB) | HTML iconHTML

    Efficient computation of extensions of banded, partially known covariance matrices is provided by the classical Levinson algorithm. One contribution of this paper is the introduction of a generalization of this algorithm that is applicable to a substantially broader class of extension problems. This generalized algorithm can compute unknown covariance elements in any order that satisfies certain g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential detection of targets in multichannel systems

    Publication Year: 2003, Page(s):425 - 445
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1911 KB) | HTML iconHTML

    It is supposed that there is a multichannel sensor system which performs sequential detection of a target. Sequential detection is done by implementing a generalized Wald's sequential probability ratio test, which is based on the maximum-likelihood ratio statistic and allows one to fix the false-alarm rate and the rate of missed detections at specified levels. We present the asymptotic performance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semidefinite programming approach to optimal unambiguous discrimination of quantum states

    Publication Year: 2003, Page(s):446 - 456
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (669 KB) | HTML iconHTML

    We consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proof of security of quantum key distribution with two-way classical communications

    Publication Year: 2003, Page(s):457 - 475
    Cited by:  Papers (144)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 KB) | HTML iconHTML

    Shor and Preskill (see Phys. Rev. Lett., vol.85, p.441, 2000) have provided a simple proof of security of the standard quantum key distribution scheme by Bennett and Brassard (1984) by demonstrating a connection between key distribution and entanglement purification protocols (EPPs) with one-way communications. Here, we provide proofs of security of standard quantum key distribution schemes, Benne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of simple nonlogarithmic loss functions

    Publication Year: 2003, Page(s):476 - 484
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (795 KB) | HTML iconHTML

    The loss complexity for nonlogarithmic loss functions is defined analogously to the stochastic complexity for logarithmic loss functions such that its mean provides an achievable lower bound for estimation, the mean taken with respect to the worst case data generating distribution. The loss complexity also provides a lower bound for the worst case mean prediction error for all predictors. For the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The separability of standard cyclic N-ary Gray codes

    Publication Year: 2003, Page(s):485 - 487
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    A sharp lower bound is derived for the cyclic list distance between two codewords, having Hamming distance m, in the standard N-ary Gray code of length n, for 1/spl les/m/spl les/n and for even values of N. The bound generalizes a similar result in the binary case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Disproof of a conjecture on the existence of balanced optimal covering codes

    Publication Year: 2003, Page(s):487 - 488
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (199 KB) | HTML iconHTML

    The minimum number of codewords in a binary code with length n and covering radius R is denoted by K(n,R), and corresponding codes are called optimal. A code with M words is said to be balanced in a given coordinate if the number of 0's and 1's in this coordinate are at least /spl lfloor/M/2/spl rfloor/. A code is balanced if it is balanced in all coordinates. It has been conjectured that among op... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on the statistical distribution of the crest-factor in OFDM transmission

    Publication Year: 2003, Page(s):488 - 494
    Cited by:  Papers (44)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB) | HTML iconHTML

    This article analyzes the crest-factor behavior of an orthogonal frequency-division multiplexing (OFDM) modem. The behavior is characterized in terms of the complementary distribution function of the crest-factor (CDFC). The CDFC is a key parameter of OFDM systems, for example it provides limits on achievable information rates. Several approximations have been developed in the literature so far, b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of resilient functions with high nonlinearity

    Publication Year: 2003, Page(s):494 - 501
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (462 KB) | HTML iconHTML

    We provide a construction technique for multiple-output resilient functions F:F/sub 2//sup n//spl rarr/F/sub 2//sup m/ with high nonlinearity. The construction leads to the problem of finding a set of linear codes with a fixed minimum distance, having the property that the intersection between any two codes is the all-zero codeword only. This problem is considered, and existence results are provid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Periodic sequences with large k-error linear complexity

    Publication Year: 2003, Page(s):501 - 505
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    We establish the existence of periodic sequences over a finite field which simultaneously achieve the maximum value (for the given period length) of the linear complexity and of the k-error linear complexity for small values of k. This disproves a conjecture of Ding, Xiao, and Shan (1991). The result is of relevance for the theory of stream ciphers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A large-deviations notion of perfect secrecy

    Publication Year: 2003, Page(s):506 - 508
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    We consider the Shannon cipher system with a variable key rate, and study the necessary and sufficient conditions for perfect secrecy in the sense that the exponential rate of the probability of breaking into the system would not be improved by observing the cryptogram. For a memoryless plain text source, we derive achievable lower bounds on the number of key bits needed for almost every plain tex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On finite sample statistics for Yule-Walker estimates

    Publication Year: 2003, Page(s):509 - 516
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (443 KB) | HTML iconHTML

    The expectation of the square of the reflection coefficient in small samples of white noise is derived. This variance of the reflection coefficient in white noise is a key factor in the statistics of the estimation of autoregressive (AR) models in small samples. Approximations of this expectation are constructed that are more accurate than the known first-order Taylor approximation. These better a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the approximate decorrelation property of the discrete wavelet transform for fractionally differenced processes

    Publication Year: 2003, Page(s):516 - 521
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (359 KB) | HTML iconHTML

    In this correspondence, we develop an asymptotic theory for the correlations of wavelet coefficients of the discrete wavelet transform (DWT) for fractionally differenced processes. It provides a theoretical justification for the approximate decorrelation property of the DWT for fractionally differenced processes. In addition, it provides insights on how the length of the wavelet filter affects the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice codebook enumeration for generalized Gaussian source

    Publication Year: 2003, Page(s):521 - 527
    Cited by:  Papers (14)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (426 KB) | HTML iconHTML

    The goal of this correspondence is to propose a low-complexity enumeration algorithm for lattice vectors, based on a geometrical interpretation and valid for different source distributions, i.e., for different L/sub p/-norms in the range 0<p/spl les/2. As a particular case, we obtain the Laplacian enumeration formula of Fischer. This point of view offers various advantages and particularly it e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Errata to "Asymptotic Analysis of a Fast Algorithm for Efficient Multiple Frequency Estimation"

    Publication Year: 2003, Page(s): 529
    Request permission for commercial reuse | PDF file iconPDF (173 KB) | HTML iconHTML
    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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu