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
  • About priority encoding transmission

    Publication Year: 2000, Page(s):699 - 705
    Cited by:  Papers (32)
    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.
  • 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.
  • A relationship between linear complexity and k-error linear complexity

    Publication Year: 2000, Page(s):694 - 698
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    Linear complexity is an important cryptographic criterion of stream ciphers. The k-error linear complexity of a periodic sequence of period N is defined as the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. This article shows a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is stric... 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.
  • 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.
  • On the equivalence of generalized concatenated codes and generalized error location codes

    Publication Year: 2000, Page(s):642 - 649
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (316 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.
  • 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.
  • Optimal transmit-receiver design in the presence of signal-dependent interference and channel noise

    Publication Year: 2000, Page(s):577 - 584
    Cited by:  Papers (159)
    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.
  • 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.
  • 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.
  • Entropy expressions for multivariate continuous distributions

    Publication Year: 2000, Page(s):709 - 712
    Cited by:  Papers (32)
    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.
  • Sequential multiple hypothesis testing and efficient fault detection-isolation in stochastic systems

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

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

    Publication Year: 2000, Page(s):325 - 343
    Cited by:  Papers (280)  |  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.
  • Robust decoding for timing channels

    Publication Year: 2000, Page(s):405 - 419
    Cited by:  Papers (28)
    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.
  • Split group codes

    Publication Year: 2000, Page(s):485 - 495
    Cited by:  Papers (11)
    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.
  • On the theory of space-time codes for PSK modulation

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

    Publication Year: 2000, Page(s):705 - 709
    Cited by:  Papers (15)
    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.
  • Footprints or generalized Bezout's theorem

    Publication Year: 2000, Page(s):635 - 641
    Cited by:  Papers (8)
    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.

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