IEEE Transactions on Information Theory

Volume 39 Issue 5 • Sep 1993

Filter Results

Displaying Results 1 - 25 of 39
  • Structure and properties of linear recurring m-arrays

    Publication Year: 1993, Page(s):1758 - 1762
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    The structure of linear recurring m-arrays is studied. It is proved that any linear recurring m-array can be obtained by “folding” an m-sequence. The properties of translation-addition, sampling and correlation of linear recurring m-arrays are also discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corrected proof of de Buda's theorem [lattice channel codes]

    Publication Year: 1993, Page(s):1735 - 1737
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    An error in de Buda's (see IEEE J. Select Areas Commun., vol. 7, no. 6, p. 893, 1989) proof on the asymptotic optimality of lattice channel codes is pointed out and corrected using a modification of de Buda's approach. Comments are given on the correct interpretation and the limitations of this result View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of skew-tolerant and skew-detecting codes

    Publication Year: 1993, Page(s):1751 - 1757
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The paradigm of skew-tolerant parallel asynchronous communication was introduced by Blaum and Bruck (see ibid., vol. 39, 1993) along with constructions for codes that can tolerate or detect skew. Some of these constructions were improved by Khachatrian (1991). In this paper these constructions are improved upon further, and the authors prove that the new constructions are, in a certain sense, opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound on mean-square-estimate error

    Publication Year: 1993, Page(s):1675 - 1680
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    A lower bound on mean-square-estimate error is derived as an instance of the covariance inequality by concatenating the generating matrices for the Bhattacharyya and Barankin bounds; it represents a generalization of the Bhattacharyya, Barankin, Cramer-Rao, Hammersley-Chapman-Robbins, Kiefer, and McAulay-Hofstetter bounds in that all of these bounds may be derived as special cases. The bound is ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed decoding of cyclic block codes using a generalization of majority-logic decoding

    Publication Year: 1993, Page(s):1535 - 1545
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    One-step majority-logic decoding is one of the simplest algorithms for decoding cyclic block codes. However, it is an effective decoding scheme for very few codes. This paper presents a generalization based on the “common-symbol decoding problem.” Suppose one is given M (possibly corrupted) codewords from M (possibly different) codes over the same field; suppose further that the codewo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotic expression for the information and capacity of a multidimensional channel with weak input signals

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

    An asymptotic expression is derived for the Shannon mutual information between the input and output signals for a relatively large class of continuous alphabet memoryless channels in the case of weak input signals, when the input space is multidimensional. The authors extend a result of Ibragimov and Khas'minskii (1972) from the one-dimensional to the N-dimensional case. The asymptotic expression ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the generalized Hamming weights of product codes

    Publication Year: 1993, Page(s):1709 - 1713
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    The rth generalized Hamming weight of a linear code is the minimum support size of any r-dimensional subcode. It has been found useful in the studies of cryptography and trellis coding. The authors derive several results on expressing the generalized Hamming weights of a product code in terms of those of its component codes. They also formulate a general conjecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further results on distributed Bayesian signal detection

    Publication Year: 1993, Page(s):1660 - 1661
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    The problem of distributed Bayesian signal detection is addressed. The problem is reformulated and a new design approach is presented that allows the use of efficient optimization algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on distributed estimation and sufficiency

    Publication Year: 1993, Page(s):1765 - 1767
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    In relation to distributed parameter estimation, the notion of local and global sufficient statistics is introduced. It is shown that when a sufficiency condition is satisfied by the probability distribution of a random sample, a global sufficient statistic is obtainable as a function of local sufficient statistics. Several standard distributions satisfy the said sufficiency condition View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Twelve good rate (m-r)/pm quasi-cyclic codes

    Publication Year: 1993, Page(s):1750 - 1751
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    Twelve new quasi-cyclic (QC) codes are presented which improve the bounds on the best known binary linear codes. They are rate (m-r)/pm, r>1, codes constructed by deleting r rows from the circulant matrices of rate m/pm QC codes, based on the factors of xm-1. Heuristic combinatorial optimization was used to find these codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A survey of the theory of source coding with a fidelity criterion

    Publication Year: 1993, Page(s):1473 - 1490
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1880 KB)

    The purpose of this paper is threefold: 1) to acquaint the reader with the types of problems that have been considered in the area of source coding with a fidelity criterion; 2) to survey results that have been obtained on these problems; and 3) to outline future research trends in the area View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The analysis of the expected successful operation time of slotted ALOHA

    Publication Year: 1993, Page(s):1567 - 1577
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    It has been well-known for nearly 20 years that the bistable behavior of infinite population slotted ALOHA networks causes the unpleasant effect of eventually reaching an overloaded state, where the number of backlogged stations becomes larger and larger and the useful throughput reduces to zero. The detailed analysis reveals that this statement is true for any average offered load λ>0, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forward collision resolution-a technique for random multiple-access to the adder channel

    Publication Year: 1993, Page(s):1671 - 1675
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    Consider M-Choose-T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method for constructing codes that achieve error-free M-Choose-T communication over the noiseless adder channel (AC), at a nominal rate of 1/T bits per channel symbol per active user, is described and an efficient decoding procedure is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum distance bounds for cyclic codes and Deligne's theorem

    Publication Year: 1993, Page(s):1524 - 1534
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    At the present time, there are very good methods to obtain bounds for the minimum distance of BCH codes and their duals. On the other hand, there are few other bounds suitable for general cyclic codes. Therefore, research Problem 9.9 of MacWilliams and Sloane (1977), The Theory of Error-Correcting Codes, asks if the bound of Deligne (1974) for exponential sums in several variables or the bound of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalization of the entropy power inequality with applications

    Publication Year: 1993, Page(s):1723 - 1728
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The authors prove the following generalization of the entropy power inequality: h(ax_)⩾h(Ax_) where h(·) denotes (joint-) differential-entropy x_=x1...xn , is a random vector with independent components, x˜_=x˜...x˜n, is a Gaussian vector with independent components such that h(x¯i)=h(xi ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight enumerators of more irreducible cyclic binary codes

    Publication Year: 1993, Page(s):1701 - 1709
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The weight enumerators of all nondegenerate irreducible cyclic binary (n, k) codes have been computed for which k>27 and N=(2k-1)/n<500. The methods used are those developed by McEliece and further expanded by Ward and Segar (1986), using algebraic number theory and Stickelberger's theorem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic properties of data compression and suffix trees

    Publication Year: 1993, Page(s):1647 - 1659
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    Recently, Wyner and Ziv (see ibid., vol.35, p.1250-8, 1989) have proved that the typical length of a repeated subword found within the first n positions of a stationary ergodic sequence is (1/h) log n in probability where h is the entropy of the alphabet. This finding was used to obtain several insights into certain universal data compression schemes, most notably the Lempel-Ziv data compression a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of protocol sequences for multiple access collision channel without feedback

    Publication Year: 1993, Page(s):1762 - 1765
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (348 KB)

    Constructions of protocol sequences for multiple-access collision channel without feedback are given. These constructions are the extensions of those described by A, Gyorfi, and Massey (see ibid., vol.38, p. 940, May 1992). If the basic code in their constructions, a Reed-Solomon code, is replaced by a BCH code then the resulting protocol sequences have the feature that, for a given sum rate, the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundant multitrack (d, k) codes

    Publication Year: 1993, Page(s):1744 - 1750
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Multitrack run-length-limited (d, k) modulation codes were recently introduced as a method to increase storage densities in magnetic and optical recording systems. These codes are a generalization of the usual run-length-limited (d, K) codes and provide for increased storage density by relaxing the k-constraint and encoding multiple tracks in parallel. Previously, n-track (d, K) codes used all n t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error probability for repeat request systems with convolutional codes

    Publication Year: 1993, Page(s):1680 - 1684
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    A new decoding algorithm based on the modified Viterbi algorithm for repeat request systems is considered. A new asymptotic error probability bound is derived. It is shown that the error exponent for convolutional coding can be related to the exponent for block coding by a graphical method known as inverse concatenation construction View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block arithmetic coding for source compression

    Publication Year: 1993, Page(s):1546 - 1554
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    We introduce “Block Arithmetic Coding” (BAC), a technique for entropy coding that combines many of the advantages of ordinary stream arithmetic coding with the simplicity of block codes. The code is variable length in to fixed out (V to F), unlike Huffman coding which is fixed in to variable out (F to V). We develop two versions of the coder: 1) an optimal encoder based on dynamic prog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaching capacity by equiprobable signaling on the Gaussian channel

    Publication Year: 1993, Page(s):1714 - 1716
    Cited by:  Papers (50)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    For the additive white Gaussian noise channel, there is a gap between the channel capacity and the highest achievable rate of equiprobable uniformly spaced one-dimensional signaling. It is commonly believed that approaching channel capacity requires the constituent one-dimensional signal points to have a Gaussian probability distribution. It is shown that the channel capacity can be achieved by eq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the construction of systematic tEC/AUED codes

    Publication Year: 1993, Page(s):1662 - 1669
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    A new approach for the construction of systematic tEC/AUED codes is presented. These new constructions improve many values of the upper bound on the redundancy of the code for t=1 and 2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders

    Publication Year: 1993, Page(s):1491 - 1513
    Cited by:  Papers (151)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2060 KB)

    A group code C over a group G is a set of sequences of group elements that itself forms a group under a component-wise group operation. A group code has a well-defined state space Σk at each time k. Each code sequence passes through a well-defined state sequence. The set of all state sequences is also a group code, the state code of C. The state code defines an essentially unique... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information theory and radar waveform design

    Publication Year: 1993, Page(s):1578 - 1597
    Cited by:  Papers (319)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1688 KB)

    The use of information theory to design waveforms for the measurement of extended radar targets exhibiting resonance phenomena is investigated. The target impulse response is introduced to model target scattering behavior. Two radar waveform design problems with constraints on waveform energy and duration are then solved. In the first, a deterministic target impulse response is used to design wave... 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