IEEE Transactions on Information Theory

Volume 46 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
  • On systematic single asymmetric error-correcting codes

    Publication Year: 2000, Page(s):669 - 672
    Cited by:  Papers (12)
    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 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.
  • 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.
  • 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.
  • Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading

    Publication Year: 2000, Page(s):543 - 564
    Cited by:  Papers (648)  |  Patents (44)
    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.
  • On the equivalence of generalized concatenated codes and generalized error location codes

    Publication Year: 2000, Page(s):642 - 649
    Cited by:  Papers (16)  |  Patents (4)
    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.
  • 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.
  • The capacity of wireless networks

    Publication Year: 2000, Page(s):388 - 404
    Cited by:  Papers (4816)  |  Patents (71)
    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.
  • 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.
  • A new recursive universal code of the positive integers

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

    A new recursive universal code of the positive integers is proposed, in which any given sequence can be used as a delimiter of codeword while bit “0” is used as a delimiter in known universal codes, e.g., Levenshtein code, Elias ω code, Even-Rodeh code, Stout code, Bentley-Yao code, etc. The codeword length of the proposed code is shorter than log2n n in alm... 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.
  • Source code with cost as a nonuniform random number generator

    Publication Year: 2000, Page(s):712 - 717
    Cited by:  Papers (7)  |  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.
  • 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 (656 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Common randomness and secret key generation with a helper

    Publication Year: 2000, Page(s):344 - 366
    Cited by:  Papers (134)  |  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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Minimum description length induction, Bayesianism, and Kolmogorov complexity

    Publication Year: 2000, Page(s):446 - 464
    Cited by:  Papers (95)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 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.
  • 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.

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