IEEE Transactions on Information Theory

Volume 46 Issue 2 • March 2000

Filter Results

Displaying Results 1 - 25 of 41
  • The generalized distributive law

    Publication Year: 2000, Page(s):325 - 343
    Cited by:  Papers (288)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 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.
  • Common randomness and secret key generation with a helper

    Publication Year: 2000, Page(s):344 - 366
    Cited by:  Papers (144)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (779 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 transmit to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The common randomness capacity of a network of discrete memoryless channels

    Publication Year: 2000, Page(s):367 - 387
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (651 KB)

    We generalize our previous results on generating common randomness at two terminals to a situation where any finite number of agents, interconnected by an arbitrary network of independent, point-to-point, discrete memoryless channels, wish to generate common randomness by interactive communication over the network. Our main result is an exact characterization of the common randomness capacity of s... 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 (4975)  |  Patents (71)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (369 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 /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are opti... 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 (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (455 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//spl mu/ seconds, we show that the rate e/sup -1//spl mu/ nats per second (capacity of the exponential server timing channel) is achievable using this decoder. We show that a... 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 (343 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.
  • Asymptotic minimax regret for data compression, gambling, and prediction

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

    For problems of data compression, gambling, and prediction of individual sequences x/sub 1/, /spl middot//spl middot//spl middot/, x/sub n/ the following questions arise. Given a target family of probability mass functions p(x/sub 1/, /spl middot//spl middot//spl middot/, x/sub n/|/spl theta/), how do we choose a probability mass function q(x/sub 1/, /spl middot//spl middot//spl middot/, x/sub n/)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum description length induction, Bayesianism, and Kolmogorov complexity

    Publication Year: 2000, Page(s):446 - 464
    Cited by:  Papers (100)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (449 KB)

    The relationship between the Bayesian approach and the minimum description length approach is established. We sharpen and clarify the general modeling principles minimum description length (MDL) and minimum message length (MML), abstracted as the ideal MDL principle and defined from Bayes's rule by means of Kolmogorov complexity. The basic condition under which the ideal principle should be applie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform coding with integer-to-integer transforms

    Publication Year: 2000, Page(s):465 - 473
    Cited by:  Papers (21)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    A new interpretation of transform coding is developed that downplays quantization and emphasizes entropy coding, allowing a comparison of entropy coding methods with different memory requirements. With conventional transform coding, based on computing Karhunen-Loeve transform coefficients and then quantizing them, vector entropy coding can be replaced by scalar entropy coding without an increase i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enumeration and criteria for cyclically shift-distinct GMW sequences

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

    Gordon-Mills-Welch (GMW) sequences (also called cascaded GMW sequences) have two-level autocorrelations. This property makes them widely used in various communication and cryptographic systems. The generation of q-ary GMW sequences of period q/sup n-1/ involves three types of parameters. To determine whether GMW sequences are cyclically shift-distinct for differing parameters has remained an open ... 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 (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 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.
  • 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 (363 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 analysis of Chen's construction of minimum-distance five codes

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

    In 1991, C.L. Chen used the inverted construction Y/sub 1/ on binary linear codes of minimum Hamming distance five to construct a new [47, 36, 5] code. We examine this construction in depth and show that no such codes are obtained unless the fields GF(8) or GF(32) are used. Using MAGMA, we prove that the binary [11, 4, 5] code and the binary [15, 7, 5] extension found by Chen are the only possible... 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 (364 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 the theory of space-time codes for PSK modulation

    Publication Year: 2000, Page(s):524 - 542
    Cited by:  Papers (272)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (446 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.
  • Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

    Publication Year: 2000, Page(s):543 - 564
    Cited by:  Papers (666)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 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/spl times/M space-time signals ... 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 (240 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.
  • Optimal transmit-receiver design in the presence of signal-dependent interference and channel noise

    Publication Year: 2000, Page(s):577 - 584
    Cited by:  Papers (180)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 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.
  • Two rank order tests for M-ary detection

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

    We consider a general M-ary detection problem where, given M groups of L samples each, the problem is to identify which unique group of L samples have come from the signal hypothesis. The optimal likelihood ratio test is unrealizable, when the joint distribution of M L samples is not completely known. We consider two rank order types of tests termed the modified rank test (MRT) and the modified ra... 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 (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (517 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.
  • Decoding real block codes: activity detection Wiener estimation

    Publication Year: 2000, Page(s):609 - 623
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (307 KB)

    New decoding procedures for real-number block codes which are constructed by imposing constraints in the discrete Fourier transform (DFT) domain are examined. The codewords are corrupted by small levels of roundoff noise and possibly occasionally by a few large excursions of random disturbances. The error-correcting procedure is separated into two parts, large activity detection followed by error ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless sliding-block compression of constrained systems

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

    A method is presented for designing lossless sliding-block compression schemes that map constrained sequences onto unconstrained ones. The new compression scheme is incorporated into a coding technique for noisy constrained channels, which has applications to magnetic and optical storage. As suggested previously by Immink (see ibid., vol.43, p.1389-99, 1997), the use of a lossless compression code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DC-free codes of rate (n-1)/n, n odd

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

    We report on a new class of DC-free codes of rate (n-1)/n, odd. The spectral and runlength properties of the new codes have been evaluated by computer simulation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Footprints or generalized Bezout's theorem

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

    In two previous papers, the first by Feng, Rao, Berg, and Zhu (see ibid., vol.43, p.1799-810, 1997) and the second by Feng, Zhu, Shi, and Rao (see Proc. 35th. Afferton Conf. Communication, Control and Computing, p.205-14, 1997), the authors use a generalization of Bezout's theorem to estimate the minimum distance and generalized Hamming weights for a class of error correcting codes obtained by eva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the equivalence of generalized concatenated codes and generalized error location codes

    Publication Year: 2000, Page(s):642 - 649
    Cited by:  Papers (18)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB)

    We show that the generator matrix of a generalized concatenated code (GCC code) of order L consists of L submatrices, where the lth submatrix is the Kronecker product of the generator matrices of the lth inner code and the lth outer code. In a similar way we show that the parity-check matrix of a generalized error location code (GEL code) of order L consists of L submatrices, where the lth submatr... 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
Alexander Barg

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

email: abarg-ittrans@ece.umd.edu