IEEE Transactions on Information Theory

Volume 45 Issue 5 • July 1999

Filter Results

Displaying Results 1 - 25 of 45
  • On the weight distribution of terminated convolutional codes

    Publication Year: 1999, Page(s):1646 - 1648
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (98 KB)

    In this correspondence, the low-weight terms of the weight distribution of the block code obtained by terminating a convolutional code after x information blocks are expressed as a function of x. It is shown that this function is linear in x for codes with noncatastrophic encoders, but quadratic in x for codes with catastrophic encoders. These results are useful to explain the poor performance of ... View full abstract»

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

    Publication Year: 1999, Page(s):1742 - 1751
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Some inequalities relating different measures of divergence between two probability distributions

    Publication Year: 1999, Page(s):1728 - 1735
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    This note presents new inequalities relating different divergence measures in the family of “convex likelihood-ratio expectation” measures of Csiszar (1967), Ali and Silvey (1966), and especially in the single-parameter family of “AM-GM” divergence measures. The most prominent result is that θ2 ⩽¼J, where θ is the Bhattacharyya angle of div... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of two-dimensional run-length constrained channels

    Publication Year: 1999, Page(s):1527 - 1540
    Cited by:  Papers (74)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Two-dimensional binary patterns that satisfy one-dimensional (d, k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd,k is defined as Cd,k=limm,n→∞log2Nm,n d,k/mn, where Nm,nd,k denotes the number of m×n rectangular patterns that satisf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple ramp schemes

    Publication Year: 1999, Page(s):1720 - 1728
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    A (t,k,n,S) ramp scheme is a protocol to distribute a secret s chosen in S among a set P of n participants in such a way that: (1) sets of participants of cardinality greater than or equal to k can reconstruct the secret s; (2) sets of participants of cardinality less than or equal to t have no information on s, whereas (3) sets of participants of cardinality greater than t and less than k might h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatially correlated qubit errors and burst-correcting quantum codes

    Publication Year: 1999, Page(s):1703 - 1708
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, one can find one-d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal tail-biting trellises: the Golay code and more

    Publication Year: 1999, Page(s):1435 - 1455
    Cited by:  Papers (84)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Tail-biting trellis representations of block codes are investigated. We develop some elementary theory, and present several intriguing examples, which we hope will stimulate further developments in this field. In particular, we construct a 16-state 12-section structurally invariant tail-biting trellis for the (24, 12, 8) binary Golay code. This tail-biting trellis representation is minimal: it sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Preparata and Goethals codes: trellis complexity and twisted squaring constructions

    Publication Year: 1999, Page(s):1667 - 1673
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The trellis complexity of the Preparata and Goethals codes is examined. It is shown that at least for a given set of permutations these codes are rectangular. Upper bounds on the state complexity profiles of the Preparata and Goethals codes are given. The upper bounds on the state complexity of the Preparata and Goethals codes are determined by the dimension/length profiles (DLP) of the extended p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum power control over fading channels

    Publication Year: 1999, Page(s):1468 - 1489
    Cited by:  Papers (517)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    We study optimal constant-rate coding schemes for a block-fading channel with strict transmission delay constraint, under the assumption that both the transmitter and the receiver have perfect channel-state information. We show that the information outage probability is minimized by concatenating a standard “Gaussian” code with an optimal power controller, which allocates the transmitt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the non Z4-linearity of certain good binary codes

    Publication Year: 1999, Page(s):1674 - 1677
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    In this correspondence we prove that any extremal doubly-even self-dual linear binary code of length 48 is not Z4-linear. We also show that the putative extremal doubly-even self-dual linear binary codes of lengths 72 and 96 with minimum weight, respectively, 16 and 20, cannot be constructed as the Gray images of linear codes over Z4 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semi-continuous version of the Berger-Yeung problem

    Publication Year: 1999, Page(s):1520 - 1526
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    We present a continuous dual of multiterminal source encoding with one distortion criterion (the “Berger-Yeung (1989) problem”). A continuous source X is encoded with “high resolution” (Dx→0), with the aid of a “helper,” i.e., a correlated discrete or continuous source Y, that is encoded separately subject to some arbitrary distortion criterion D... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability of N interacting queues in random-access systems

    Publication Year: 1999, Page(s):1579 - 1587
    Cited by:  Papers (136)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    We revisit the stability problem of systems consisting of N buffered terminals accessing a common receiver over the collision channel by means of the standard ALOHA protocol. We find that in the slotted ALOHA system queues have “instability rank” based on their individual average arrival rates and transmission probabilities. If a queue is stable, then the queue with lower instability r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems

    Publication Year: 1999, Page(s):1717 - 1719
    Cited by:  Papers (61)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    The Tate pairing is used to reduce the discrete logarithm (DL) problem on certain elliptic curves to the DL in the multiplicative group of finite fields View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel codes: theoretical concepts and practical design rules

    Publication Year: 1999, Page(s):1361 - 1391
    Cited by:  Papers (484)  |  Patents (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    This paper deals with 2l-ary transmission using multilevel coding (MLC) and multistage decoding (MSD). The known result that MLC and MSD suffice to approach capacity if the rates at each level are appropriately chosen is reviewed. Using multiuser information theory, it is shown that there is a large space of rate combinations such that MLC and full maximum-likelihood decoding (MLD) can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new look at entropy for solving linear inverse problems

    Publication Year: 1999, Page(s):1565 - 1578
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    Entropy-based methods are widely used for solving inverse problems, particularly when the solution is known to be positive. Here, we address linear ill-posed and noisy inverse problems of the form z=Ax+n with a general convex constraint x∈X, where X is a convex set. Although projective methods are well adapted to this context, we study alternative methods which rely highly on some “info... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum Reed-Muller codes

    Publication Year: 1999, Page(s):1701 - 1703
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    A set of quantum error-correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]]=[[2 r,sr-C(r,t)-2Σi=0t-1 C(r,i),2t+2t-1]] View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On algebraic decoding of the Z4-linear Calderbank-McGuire code

    Publication Year: 1999, Page(s):1423 - 1434
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The quaternary Calderbank-McGuire (see Des., Codes Cryptogr., vol.10, no.2, 1997) code is a Z4-linear code of length 32 which has 237 codewords and a minimum Lee distance of 12. The Gray map of this code is known to be a nonlinear binary (64, 237,12) code. The Z4-linear Calderbank-McGuire code can correct all errors with Lee weight &les... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The weighted coordinates bound and trellis complexity of block codes and periodic packings

    Publication Year: 1999, Page(s):1658 - 1667
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    Weighted entropy profiles and a new bound, the weighted coordinates bound, on the state complexity profile of block codes are presented. These profiles and bound generalize the notion of dimension/length profile (DLP) and entropy/length profile (ELF) to block codes whose symbols are not drawn from a common alphabet set, and in particular, group codes. Likewise, the new bound may improve upon the D... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A universal lattice code decoder for fading channels

    Publication Year: 1999, Page(s):1639 - 1642
    Cited by:  Papers (1021)  |  Patents (85)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    We present a maximum-likelihood decoding algorithm for an arbitrary lattice code when used over an independent fading channel with perfect channel state information at the receiver. The decoder is based on a bounded distance search among the lattice points falling inside a sphere centered at the received point. By judicious choice of the decoding radius we show that this decoder can be practically... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient generation of fair dice with few biased coins

    Publication Year: 1999, Page(s):1600 - 1606
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    Given a random variable X which takes n equiprobable values, we consider several algorithmic questions related to the classical problem of simulating the outcomes of X by using a limited number of biased coins View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to overcome the curse of long-memory errors

    Publication Year: 1999, Page(s):1735 - 1741
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    Long-memory errors dramatically slow down the convergence of minimax risks in a fixed design nonparametric regression. The problem becomes even more complicated for the case of adaptive estimation. This defines the curse of long-memory errors. I show that using a random design, instead of a fixed one, allows one to overcome this curse and make familiar data-driven estimators robust. Moreover, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes

    Publication Year: 1999, Page(s):1709 - 1712
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    In this correspondence we give geometric codes on one of the curves of Garcia-Stichtenoth (1995) with the property that the true distances are bigger than Feng-Rao distances. Moreover, an example for which the Feng-Rao algorithm cannot correct more than [(dFR-1)/2]+1(<[(dtrue-1)/2]) errors is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient digital-to-analog encoding

    Publication Year: 1999, Page(s):1551 - 1554
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    An important issue in analog circuit design is the problem of digital-to-analog conversion, i.e., the encoding of Boolean variables into a single analog value which contains enough information to reconstruct the values of the Boolean variables. A natural question is: what is the complexity of implementing the digital-to-analog encoding function? That question was answered by Wegener (see Inform. P... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient estimation of neural weights by polynomial approximation

    Publication Year: 1999, Page(s):1541 - 1550
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    It has been known for some years that the uniform-density problem for forward neural networks has a positive answer: any real-valued, continuous function on a compact subset of Rd can be uniformly approximated by a sigmoidal neural network with one hidden layer. We design here algorithms for efficient uniform approximation by a certain class of neural networks with one hidden layer whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time block codes from orthogonal designs

    Publication Year: 1999, Page(s):1456 - 1467
    Cited by:  Papers (4625)  |  Patents (237)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed b... 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