IEEE Transactions on Information Theory

Issue 5 • Sep 1993

Filter Results

Displaying Results 1 - 25 of 39
  • Relative uniformity of sources and the comparison of optimal code costs

    Publication Year: 1993, Page(s):1695 - 1697
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (272 KB)

    Conditions on the probability distributions of two sources that describe their relative uniformity are shown to be sufficient for inequalities on their minimum average codeword lengths and entropies. The Huffman coding problem and variants involving Renyi entropy are addressed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm

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

    Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and design rules are presented. Better results are demonstrated for the partial response CPM schemes and p... 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.
  • On the covariance function of stationary binary sequences with given mean

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

    Recent work on characterizing the covariance functions of stationary binary sequences has been geometric in flavor. Extreme distributions induced in windows of a given length are obtained from special periodic sequences. The work is extended to sequences with a given mean m, revealing some finer structure 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.
  • 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.
  • Bounded distance decoding of unit memory codes

    Publication Year: 1993, Page(s):1616 - 1627
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1144 KB)

    We discuss minimum distance decoding of convolutional codes. The relevant distance functions are defined, and the set of correctable error patterns is described by a sequence of weight constraints. Decoding methods for error patterns of bounded weight are described, and it is demonstrated that these methods offer a favorable combination of performance and complexity. Exact values and upper bounds ... 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.
  • Approaching capacity by equiprobable signaling on the Gaussian channel

    Publication Year: 1993, Page(s):1714 - 1716
    Cited by:  Papers (50)  |  Patents (5)
    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.
  • 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.
  • Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes

    Publication Year: 1993, Page(s):1514 - 1523
    Cited by:  Papers (81)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (868 KB)

    The authors present a novel and efficient maximum-likelihood soft-decision decoding algorithm for linear block codes. The approach used here converts the decoding problem into a search problem through a graph that is a trellis for an equivalent code of the transmitted code. A generalized Dijkstra's algorithm, which uses a priority-first search strategy, is employed to search through this graph. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.
  • Three results on interactive communication

    Publication Year: 1993, Page(s):1608 - 1615
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (600 KB)

    X and Y are random variables. Person Px knows X, Person Py knows Y, and both know the underlying probability distribution of the random pair (X, Y). Using a predetermined protocol, they exchange messages over a binary, error-free, channel in order for P y to learn X. Px may or may not learn Y. Cˆ m is the number of information bits that m... 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.
  • Information theory and radar waveform design

    Publication Year: 1993, Page(s):1578 - 1597
    Cited by:  Papers (319)  |  Patents (1)
    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.
  • 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.
  • 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.
  • 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.
  • Stochastic analysis of a slotted FIFO communication channel

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

    Messages arrive randomly at one end of a slotted communication channel. They are assigned to (packed in) packets of fixed duration which queue up for transmission in first-in-first-out order; the packets are sent one per time slot. In a stochastic setting, where message durations are also random, we analyze a model which yields statistics on message delays and the number of waiting messages, assum... 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.
  • Fractal renewal processes

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

    Two relatively simple renewal processes whose power spectral densities vary as 1/fD are constructed: 1) a standard renewal point process, with 0<D<1; and 2) a finite-valued alternating renewal process, with 0<D<2. The resulting event number statistics, coincidence rates, minimal coverings, and autocorrelation functions are shown also to follow power-law forms. These fractal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-distortion bound for a class of non-Gaussian sources with memory

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

    The rate-distortion performance of a class of non-Gaussian source with memory is studied. The source model is generated from a correlated Gaussian source through a memoryless transform, which actually constitutes a special class of the frequently-used Gibbs model in speech and image processing applications. Its entropy and a rate-distortion bound are evaluated to obtain further insights into this ... 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.
  • Hartley transforms over finite fields

    Publication Year: 1993, Page(s):1628 - 1638
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (664 KB)

    A general framework is presented for constructing transforms in the field of the input which have a convolution-like property. The construction is carried out over finite fields, but is shown to be valid over the real and complex fields as well. It is shown that these basefield transforms can be viewed as “projections” of the discrete Fourier transform (DFT) and that they exist for all... View full abstract»

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

    Publication Year: 1993, Page(s):1738 - 1744
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (568 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. This paper introduces a method to construct m... 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