By Topic

IEEE Transactions on Information Theory

Issue 3 • Date May 2000

Filter Results

Displaying Results 1 - 25 of 46
  • Fundamentals of Convolutional Coding [Book Reviews]

    Publication Year: 2000, Page(s):1178 - 1179
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • Contributors

    Publication Year: 2000, Page(s):1180 - 1189
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Reversible arithmetic coding for quantum data compression

    Publication Year: 2000, Page(s):1104 - 1116
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    We study the problem of compressing a block of symbols (a block quantum state) emitted by a memoryless quantum Bernoulli source. We present a simple-to-implement quantum algorithm for projecting, with high probability, the block quantum state onto the typical subspace spanned by the lending eigenstates of its density matrix. We propose a fixed-rate quantum Shannon-Fano code to compress the project... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sphere-bound-achieving coset codes and multilevel coset codes

    Publication Year: 2000, Page(s):820 - 850
    Cited by:  Papers (109)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    A simple sphere bound gives the best possible tradeoff between the volume per point of an infinite array L and its error probability on an additive white Gaussian noise (AWGN) channel. It is shown that the sphere bound can be approached by a large class of coset codes or multilevel coset codes with multistage decoding, including certain binary lattices. These codes have structure of the kind that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extraction of optimally unbiased bits from a biased source

    Publication Year: 2000, Page(s):1093 - 1103
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We explore the problem of transforming n independent and identically biased {-1,1}-valued random variables X1,...,X n into a single {-1,1} random variable f(X1,...,X n), so that this result is as unbiased as possible. In general, no function f produces a completely unbiased result. We perform the first study of the relationship between the bias b of thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic redundancies for universal quantum coding

    Publication Year: 2000, Page(s):801 - 819
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Clarke and Barren (1990, 1994, 1995) have shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analog of this result for the two-level quantum systems. We restrict our considerations to prior probability distributions belonging to a certain one-parameter fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast and efficient construction of an unbiased random sequence

    Publication Year: 2000, Page(s):1090 - 1093
    Cited by:  Papers (9)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The problem of converting a sequence of symbols generated by a Bernoulli source into an unbiased random sequence is well-known in information theory. The proposed method is based on Elias' (1972) algorithm in which the sequence of symbols is divided into blocks of length N,N⩾1. We suggest a new method of constructing an unbiased random sequence which uses O(Nlog2N) bits of memory an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum error detection .II. Bounds

    Publication Year: 2000, Page(s):789 - 800
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    For pt.I see ibid., vol.46, no.3, p.778-88 (2000). In Part I of this paper we formulated the problem of error detection with quantum codes on the depolarizing channel and gave an expression for the probability of undetected error via the weight enumerators of the code. In this part we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A global lower bound on parameter estimation error with periodic distortion functions

    Publication Year: 2000, Page(s):1145 - 1150
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    We present a global Ziv-Zakai (1969) type lower bound on the mean square error for estimation of signal parameter vectors, where some components of the distortion function may be periodic. Periodic distortion functions arise naturally in the context of direction of arrival or phase estimation problems. The bound is applied to an image registration problem, and compared to the performance of the ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptanalysis of three mutually clock-controlled stop/go shift registers

    Publication Year: 2000, Page(s):1081 - 1090
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    A binary stream cipher consisting of three short linear-feedback shift registers (LFSRs) of total length 64 that are mutually clocked in the stop/go manner is cryptanalyzed in the known keystream sequence scenario. To reconstruct the internal state candidates at a known time from about 64 known keystream bits, two algorithms are developed. One is based on guessing a number of elements of the clock... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel

    Publication Year: 2000, Page(s):933 - 946
    Cited by:  Papers (456)  |  Patents (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    We present a model for time-varying communication single-access and multiple-access channels without feedback. We consider the difference between mutual information when the receiver knows the channel perfectly and mutual information when the receiver only has an estimate of the channel. We relate the variance of the channel measurement error at the receiver to upper and lower bounds for this diff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum error detection .I. Statement of the problem

    Publication Year: 2000, Page(s):778 - 788
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    This paper is devoted to the problem of error detection with quantum codes. We show that it is possible to give a consistent definition of the undetected error event. To prove this, we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of undetected error under natural physical assumptions concerning transmission with er... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting k symbols within one period

    Publication Year: 2000, Page(s):1174 - 1177
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    A unified derivation of the bounds of the linear complexity is given for a sequence obtained from a periodic sequence over GF(q) by either substituting, inserting, or deleting k symbols within one period. The lower bounds are useful in case of n<N/k, where N and n are the period and the linear complexity of the sequence, respectively. It is shown that all three different cases can be treated ve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of the wireless packet collision channel without feedback

    Publication Year: 2000, Page(s):1141 - 1144
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    It is desirable in random-access protocols for wireless mobile communications to avoid the need for feedback and retransmissions. The pure ALOHA protocol can use erasure correction coding in place of retransmissions to maintain a throughput of 0.184. We show in this note that if we use error-correction coding (instead of erasure correction coding) throughput levels not less than 0.322 can be reali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MDS secret-sharing scheme secure against cheaters

    Publication Year: 2000, Page(s):1078 - 1081
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    For the problem of cheaters in secret-sharing schemes, we introduce dcheat which is more appropriate than the minimum Hamming distance dmin of the related error-correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identity the cheaters in the scheme). We then prove that d min⩽dcheat=n-max/B∉&Gam... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cochannel interference suppression through time/space diversity

    Publication Year: 2000, Page(s):922 - 932
    Cited by:  Papers (10)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Wireless systems are subject to a time-varying and unknown a priori combination of cochannel interference, fading, and Gaussian noise. It is well known that multiple antennas can provide diversity in space that allows system tradeoffs between interference suppression and mitigation of fading. This paper describes how to achieve these same tradeoffs through diversity in time provided by channel cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models

    Publication Year: 2000, Page(s):755 - 777
    Cited by:  Papers (48)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A grammar transform is a transformation that converts any data sequence to be compressed into a grammar from which the original data sequence can be fully reconstructed. In a grammar-based code, a data sequence is first converted into a grammar by a grammar transform and then losslessly encoded. In this paper, a greedy grammar transform is first presented; this grammar transform constructs sequent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A minimax robust decoding algorithm

    Publication Year: 2000, Page(s):1158 - 1167
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    We study the decoding problem in an uncertain noise environment. If the receiver knows the noise probability density function (PDF) at each time slot or its a priori probability, the standard Viterbi (1967) algorithm (VA) or the a posteriori probability (APP) algorithm can achieve optimal performance. However, if the actual noise distribution differs from the noise model used to design the receive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic search for Golomb arrays

    Publication Year: 2000, Page(s):1170 - 1173
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    Genetic search with a decision level chromosome is used to search efficiently for Golomb (1982) arrays. A Golomb array A is a binary array with three values for its discrete autocorrelation function; M, the number of ones in A for no offset, 1 when there is partial overlap, and 0 otherwise. In one dimension, A is known as a Golomb ruler. The method yields improvement because the genetic search con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differential trellis decoding of convolutional codes

    Publication Year: 2000, Page(s):1046 - 1053
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    This paper investigates the principle of metric differences for trellis decoding of convolutional codes. Based on this differential method, a new algorithm, referred to as differential trellis decoding (DTD), is proposed. DTD offers an alternative to the conventional “add-compare-select” (ACS) method for implementing the Viterbi algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity-cost function of discrete additive noise channels with and without feedback

    Publication Year: 2000, Page(s):1131 - 1140
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    We consider modulo-q additive noise channels, where the noise process is a stationary irreducible and aperiodic Markov chain of order k. We begin by investigating the capacity-cost function (C(β)) of such additive-noise channels without feedback. We establish a tight upper bound to (C(β)) which holds for general (not necessarily Markovian) stationary q-ary noise processes. This bound con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MDS array codes for correcting a single criss-cross error

    Publication Year: 2000, Page(s):1068 - 1077
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    We present a family of maximum-distance separable (MDS) array codes of size (p-1)×(p-1), p a prime number, and minimum criss-cross distance 3, i.e., the code is capable of correcting any row or column in error, without a priori knowledge of what type of error occurred. The complexity of the encoding and decoding algorithms is lower than that of known codes with the same error-correcting powe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to turn loaded dice into fair coins

    Publication Year: 2000, Page(s):911 - 921
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    We present a new technique for simulating fair coin flips using a biased, stationary source of randomness. Sequences of random numbers are of pervasive importance in cryptography and vital to many other computing applications. Many sources of randomness, such as radioactive or quantum-mechanical sources, possess the property of stationarity. In other words, they produce independent outputs over fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An entropy theorem for computing the capacity of weakly (d,k)-constrained sequences

    Publication Year: 2000, Page(s):1034 - 1038
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    We find an analytic expression for the maximum of the normalized entropy -ΣiεTpiln piiεTipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, ΣnPn =1. This result is applied to the computation of the capacity of wea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the AEP of word-valued sources

    Publication Year: 2000, Page(s):1116 - 1120
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    We consider a new class of information sources called word-valued sources in order to investigate coding algorithms based upon string parsing. A word-valued source is defined as a pair of an independent and identically distributed (i.i.d.) source with a countable alphabet and a function that maps each symbol into a finite sequence over a finite alphabet. A word-valued source is a nonstationary pro... 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