By Topic

IEEE Transactions on Information Theory

Issue 2 • Date March 2000

Filter Results

Displaying Results 1 - 25 of 41
  • Ideals, varieties, and algorithms [Book Review]

    Publication Year: 2000, Page(s):724 - 734
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • Asymptotic minimax regret for data compression, gambling, and prediction

    Publication Year: 2000, Page(s):431 - 445
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    For problems of data compression, gambling, and prediction of individual sequences x1, ···, xn the following questions arise. Given a target family of probability mass functions p(x1, ···, x n|θ), how do we choose a probability mass function q(x 1, ···, xn) so tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On random coding error exponents of watermarking systems

    Publication Year: 2000, Page(s):420 - 430
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    Watermarking codes are analyzed from an information-theoretic viewpoint as a game between an information hider and an active attacker. While the information hider embeds a secret message (watermark) in a covertext message (typically: text, image, sound, or video stream) within a certain distortion level, the attacker processes the resulting watermarked message, within limited additional distortion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy expressions for multivariate continuous distributions

    Publication Year: 2000, Page(s):709 - 712
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    Analytical formulas for the entropy and the mutual information of multivariate continuous probability distributions are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the theory of space-time codes for PSK modulation

    Publication Year: 2000, Page(s):524 - 542
    Cited by:  Papers (267)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The design of space-time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codewords, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust decoding for timing channels

    Publication Year: 2000, Page(s):405 - 419
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    To transmit information by timing arrivals to a single-server queue, we consider using the exponential server channel's maximum likelihood decoder. For any server with service times that are stationary and ergodic with mean 1/μ seconds, we show that the rate e -1μ nats per second (capacity of the exponential server timing channel) is achievable using this decoder. We show that a s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the linear span of an FCSR

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

    We have derived a lower bound on the linear span of a binary sequence generated by a feedback with carry shift register (FCSR) under the following condition: q is a power of a prime such that q=re (e⩾2) and r(=2p+1), where both r and p are 2-prime. This allows us to design FCSR stream ciphers similar to previously proposed linear feedback shift register (LFSR) stream ciphers View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The generalized distributive law

    Publication Year: 2000, Page(s):325 - 343
    Cited by:  Papers (259)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    We discuss a general message passing algorithm, which we call the generalized distributive law (GDL). The GDL is a synthesis of the work of many authors in information theory, digital communications, signal processing, statistics, and artificial intelligence. It includes as special cases the Baum-Welch algorithm, the fast Fourier transform (FFT) on any finite Abelian group, the Gallager-Tanner-Wib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential decoding for the exponential server timing channel

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

    We show the existence of a good tree code with a sequential decoder for the exponential server timing channel. The expected number of computations before moving one step ahead is upper-bounded by a finite number. The rate of information transfer for this code is μ/(2e) nats per second i.e., one half of the capacity. The cutoff rate for the exponential server queue is therefore at least μ/(2u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal transmit-receiver design in the presence of signal-dependent interference and channel noise

    Publication Year: 2000, Page(s):577 - 584
    Cited by:  Papers (148)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Optimal detection of a target return contaminated by signal-dependent interference, as well as additive channel noise, requires the design of a transmit pulse f(t) and a receiver impulse response h(t) jointly maximizing the output signal to interference plus noise ratio (SINR). Despite the highly nonlinear nature of this problem, it has been possible to show that f(t) may always be chosen minimum-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of wireless networks

    Publication Year: 2000, Page(s):388 - 404
    Cited by:  Papers (4438)  |  Patents (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput λ(n) obtainable by each node for a randomly chosen destination is Θ(W/√(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assign... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fourier transforms and the 2-adic span of periodic binary sequences

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

    An arithmetic or with-carry analog of Blahut's (1979) theorem is presented. This relates the length of the smallest feedback with-carry shift register to the number of nonzero classical Fourier coefficients of a periodic binary sequence View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for constructing self-dual codes with an automorphism of order 2

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

    In this paper, we investigate binary self-dual codes with an automorphism of order 2 with c cycles and f fixed points. A method for constructing such codes using self-orthogonal codes of length c and self-dual codes of length f is presented. We apply this method to construct extremal self-dual codes of lengths 40, 42, 44, 52, 54, and 58. Some of them have weight enumerators for which self-dual cod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the minimum Euclidean distance for block-coded phase-shift keying

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

    We present an upper bound on the minimum Euclidean distance dEmin(C) for block-coded PSK. The bound is an analytic expression depending on the alphabet size q, the block length n, and the number of codewords |C| of the code C. The bound is valid for all block codes with q⩾4 and with medium or high rate-codes where |C|>(q/3) n. There are several well-known block codes w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

    Publication Year: 2000, Page(s):543 - 564
    Cited by:  Papers (628)  |  Patents (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Motivated by information-theoretic considerations, we propose a signaling scheme, unitary space-time modulation, for multiple-antenna communication links. This modulation is ideally suited for Rayleigh fast-fading environments, since it does not require the receiver to know or learn the propagation coefficients. Unitary space-time modulation uses constellations of T×M space-time signals (&Ph... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • About priority encoding transmission

    Publication Year: 2000, Page(s):699 - 705
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    Albanese et al. (see ibid. vol.42, p.1737-44, 1996) introduced priority encoding transmission (PET) for sending hierarchically organized messages over lossy packet-based computer networks. In a PET system, each symbol in the message is assigned a priority which determines the minimal number of codeword symbols that is required to recover that symbol. This article revisits the PET approach using to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing the transmit power for slow fading channels

    Publication Year: 2000, Page(s):565 - 576
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    We consider the design of power-adaptive systems for minimizing the average bit-error rate over flat fading channels. Channel state information, obtained through estimation at the receiver, is sent to the transmitter over a feedback channel, where it is used to optimally adapt the transmit power. We consider finite-state optimal policies to reflect the limitations of the feedback channel. We devel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of Hermitian codes: the key equation and efficient error evaluation

    Publication Year: 2000, Page(s):512 - 523
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    This paper presents a generalization of the key equation to Hermitian codes. The syndrome is interpreted as a power series and the product of this power series with a locator polynomial gives the error evaluator polynomial. The computation of the evaluator polynomial may be done iteratively using a modified version of a previously published computationally efficient algorithm for computing locator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On systematic single asymmetric error-correcting codes

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

    It is proved that for all values of code length n, except when n=2, 4, and 8 and possibly when n=2r and n=2r+1, where r⩾1, the Hamming codes are also optimal systematic single asymmetric error-correcting codes. For the cases n=2r and n=2 r+1, r⩾4, when not all information words are used, two efficient systematic 1-asymmetric codes are described View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code

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

    In a previous paper, No, Golomb, Gong, Lee and Gaal (see ibid., vol.44, p.814-17, 1998) conjectured that certain binary sequences having a simple trace description possess the ideal autocorrelation property. In the present paper it is shown that each such sequence is balanced and, moreover, that the dual of the linear cyclic code generated by the sequence and its cyclic shifts, is a triple-error c... View full abstract»

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

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

    We construct a class of codes of length n such that the minimum distance d outside of a certain subcode is, up to a constant factor, bounded below by the square root of n, a well-known property of quadratic residue codes. The construction, using the group algebra of an Abelian group and a special partition or splitting of the group, yields quadratic residue codes, duadic codes, and their generaliz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ellipsoidal lists and maximum-likelihood decoding

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

    We study an interrelation between the coverings generated by linear (n,k)-codes and complexity of their maximum-likelihood (ML) decoding. First , discrete ellipsoids in the Hamming spaces E1n are introduced. These ellipsoids represent the sets of most probable error patterns that need to be tested in soft-decision ML decoding. We show that long linear (n,k)-codes surrounded b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential multiple hypothesis testing and efficient fault detection-isolation in stochastic systems

    Publication Year: 2000, Page(s):595 - 608
    Cited by:  Papers (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    This paper develops information-theoretic bounds for sequential multihypothesis testing and fault detection in stochastic systems. Making use of these bounds and likelihood methods, it provides a new unified approach to efficient detection of abrupt changes in stochastic systems and isolation of the source of the change upon its detection. The approach not only generalizes previous work in the lit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common randomness and secret key generation with a helper

    Publication Year: 2000, Page(s):344 - 366
    Cited by:  Papers (112)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a “helper” terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source code with cost as a nonuniform random number generator

    Publication Year: 2000, Page(s):712 - 717
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    We show that an optimal source code with a cost function for code symbols can be regarded as a random number generator generating a random sequence (not necessarily a sequence of fair coin bits) as the target distribution in the sense that the normalized conditional divergence between the distribution of the generated codeword distribution and the target distribution vanishes as the block length t... 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