IEEE Transactions on Information Theory

Volume 39 Issue 5 • Sept. 1993

Filter Results

Displaying Results 1 - 25 of 39
  • 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 (2173 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.<<ETX>> 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 (153)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2404 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 Sigma /sub 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 minima... 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 (82)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 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.
  • 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 (957 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.
  • 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 (913 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 codewords share a ... 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 (861 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 programming argu... 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 (909 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.
  • 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 (988 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 lambda >0, r... 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 (358)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1941 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.
  • Error probabilities on fading channels with intersymbol interference and noise

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

    Sums of infinite sequences of weighted binary random variables arise in communications problems involving signal-dependent interferences. In many cases of practical importance, the distribution functions of these sums are singular and often of Cantor type; they are continuous but do not have a density function. For this reason, special methods of calculating expectations are needed. Results of thi... 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 (711 KB)

    X and Y are random variables. Person P/sub x/ knows X, Person P/sub y/ 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/sub y/ to learn X. P/sub x/ may or may not learn Y. C/sub m/ is the number of information bits that must be transmitted (by both perso... 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 (1320 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.
  • 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 (789 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 lengths N f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing elliptic curve logarithms to logarithms in a finite field

    Publication Year: 1993, Page(s):1639 - 1646
    Cited by:  Papers (334)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (773 KB)

    Elliptic curve cryptosystems have the potential to provide relatively small block size, high-security public key schemes that can be efficiently implemented. As with other known public key schemes, such as RSA and discrete exponentiation in a finite field, some care must be exercised when selecting the parameters involved, in this case the elliptic curve and the underlying field. Specific classes ... 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 (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1293 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.
  • 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 (237 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.<<ETX>> 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 (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (795 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.<<ETX>> 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 (320 KB)

    Two relatively simple renewal processes whose power spectral densities vary as 1/f/sup D/ 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 chara... 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 (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (575 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.
  • A bound on mean-square-estimate error

    Publication Year: 1993, Page(s):1675 - 1680
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (670 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.
  • 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 (467 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.<<ETX>> 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 (379 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.<<ETX>> 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 (725 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.
  • 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 (333 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.<<ETX>> 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 (463 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.

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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu