IEEE Transactions on Information Theory

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
  • The entropy of traces in parallel computation

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

    The following problem arises in the context of parallel computation: how many bits of information are required to specify any one element from an arbitrary (non-empty) k-subset of a set? We characterize optimal coding techniques for this problem. We calculate the asymptotic behavior of the amount of information necessary, and construct an algorithm that specifies an element from a subset in an opt... 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 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.
  • A new look at entropy for solving linear inverse problems

    Publication Year: 1999, Page(s):1565 - 1578
    Cited by:  Papers (24)
    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.
  • 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.
  • 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.
  • A characterization of 1-perfect additive codes

    Publication Year: 1999, Page(s):1688 - 1697
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    The characterization of perfect single error-correcting codes, or 1 perfect codes, has been an open question for a long time. Recently, Rifa has proved that a binary 1-perfect code can be viewed as a distance-compatible structure in Fn and a homomorphism θ:Fn→Ω where Ω is a loop (a quasi-group with identity element). In this correspondence, we consider ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of successively refinable trellis-coded quantizers

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

    We propose successively refinable trellis-coded quantizers for progressive transmission. (Progressive transmission is an essential component of image and multimedia browsing systems.) A new trellis structure which is scalable is used in the design of our trellis-coded quantizers. A hierarchical set partitioning is developed to preserve successive refinability. Two algorithms for designing trellis-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum rate sampling and reconstruction of signals with arbitrary frequency support

    Publication Year: 1999, Page(s):1555 - 1564
    Cited by:  Papers (55)  |  Patents (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We examine the question of reconstruction of signals from periodic nonuniform samples. This involves discarding samples from a uniformly sampled signal in some periodic fashion. We give a characterization of the signals that can be reconstructed at exactly the minimum rate once a nonuniform sampling pattern has been fixed. We give an implicit characterization of the reconstruction system, and a de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometrical and performance analysis of GMD and Chase decoding algorithms

    Publication Year: 1999, Page(s):1406 - 1422
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by N0,eff=N0+N BDD. Where NBDD denotes the number of additional, non-codeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest neighbors associated with the original generalized minimum distance (GMD) and Chase ... 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 (47)
    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.
  • Low-complexity sequential lossless coding for piecewise-stationary memoryless sources

    Publication Year: 1999, Page(s):1498 - 1519
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with abruptly changing statistics. The first method, which improves on Willems' (1994) weighting approach, asymptotically achieves a lower bound on the redundancy, and hence is optimal. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New ternary linear codes

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

    Let [n,k,d;q]-codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). In this correspondence, 18 codes are constructed which improve the known lower bounds on minimum distance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions and families of nonbinary linear codes with covering radius 2

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

    New constructions of linear nonbinary codes with covering radius R=2 are proposed. They are in part modifications of earlier constructions by the author and in part are new. Using a starting code with R=2 as a “seed” these constructions yield an infinite family of codes with the same covering radius. New infinite families of codes with R=2 are obtained for all alphabets of size q⩾4... 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 (511)  |  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.
  • 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.
  • 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 composition of Tunstall messages

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

    We study the composition of messages in an encoding tree for a Tunstall code, and, more generally, in a tree whose skewness is bounded. For such trees a sort of “law of large numbers” holds true; actually, we provide a direct and converse coding theorem for variable-length to block length source codes, when a vanishing error probability is allowed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of a decoding algorithm for algebraic-geometry codes

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

    The fast decoding algorithm for one point algebraic-geometry codes of Sakata, Elbrond Jensen, and Hoholdt (see ibid., vol. 41, p. 1762-8, Nov. 1995) corrects all error patterns of weight less than half the Feng-Rao minimum distance. In this correspondence we analyze the performance of the algorithm for heavier error patterns. It turns out that in the typical case, where the error points are &ldquo... 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 (130)
    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.
  • Minimal tail-biting trellises: the Golay code and more

    Publication Year: 1999, Page(s):1435 - 1455
    Cited by:  Papers (83)  |  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.
  • An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)

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

    One describes procedures to generate the codewords of a Reed-Solomon code over GF(2m) having all their symbols in a GF(2) subspace of GF(2m). Some of the described encoders are systematic binary encoders and some are only partly systematic 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