Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 2 • 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
  • 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 (200 KB)

    In 1991, C.L. Chen used the inverted construction Y1 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 pos... 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.
  • On a sequence of cyclic codes with minimum distance six

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

    A sequence of q-ary cyclic codes is considered. For each finite field GF(q), q⩾4, there is a code with parameters [n, k, d; q]=[q(q-1)+1, q(q-1)-6, 6; q]. We show that all these codes are n-, k-, and d-optimal, with only one exception. Also the dual codes are considered. Their true minimum distances are calculated in the range 4⩽q⩽32 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 (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 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.
  • Split group codes

    Publication Year: 2000, Page(s):485 - 495
    Cited by:  Papers (8)
    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.
  • 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 (332 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.
  • 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.
  • 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 (388 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 qn-1 involves three types of parameters. To determine whether GMW sequences are cyclically shift-distinct for differing parameters has remained an ... 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 (268)  |  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.
  • 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.
  • Decoding real block codes: activity detection Wiener estimation

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

    Publication Year: 2000, Page(s):344 - 366
    Cited by:  Papers (124)  |  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.
  • 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.
  • Sequential decoding for the exponential server timing channel

    Publication Year: 2000, Page(s):705 - 709
    Cited by:  Papers (14)
    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.
  • On classes of convolutional codes that are not asymptotically catastrophic

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

    The author denotes by w0 the minimum average weight per edge over all nonzero cycles in the state diagram for a convolutional code, and assumes that a technique is available for generating canonical parity-check matrices for codes with increasing degree m. The obtained class of codes is asymptotically catastrophic if w0 approaches zero for large m. We prove the existence of c... 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 (248 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.
  • 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.
  • Constacyclic codes, cocycles and a u+v|u-v construction

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

    A connection between cohomology, cocycles and constacyclic codes is explored. It suggests an isomorphism between cyclic codes of length mn and a direct sum of m constacyclic codes of length n. The isomorphism is used (i) to study the discrete Fourier transforms and the decomposition of group ring codes; (ii) to give a u+v|u-v construction over GF(q) when q is odd. The u+v|u-v construction gives so... 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 (67)
    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.
  • Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

    Publication Year: 2000, Page(s):543 - 564
    Cited by:  Papers (638)  |  Patents (43)
    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.
  • 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 (84 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.
  • Asymptotic minimax regret for data compression, gambling, and prediction

    Publication Year: 2000, Page(s):431 - 445
    Cited by:  Papers (60)
    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.
  • The generalized distributive law

    Publication Year: 2000, Page(s):325 - 343
    Cited by:  Papers (271)  |  Patents (15)
    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.
  • The capacity of wireless networks

    Publication Year: 2000, Page(s):388 - 404
    Cited by:  Papers (4670)  |  Patents (61)
    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.

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
Prakash Narayan 

Department of Electrical and Computer Engineering