IEEE Transactions on Information Theory

Issue 1 • January 1987

Filter Results

Displaying Results 1 - 25 of 27
  • Interval and recency rank source coding: Two on-line adaptive variable-length schemes

    Publication Year: 1987, Page(s):3 - 10
    Cited by:  Papers (55)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1082 KB)

    In the schemes presented the encoder maps each message into a codeword in a prefix-free codeword set. In interval encoding the codeword is indexed by the interval since the last previous occurrence of that message, and the codeword set must be countably infinite. In recency rank encoding the codeword is indexed by the number of distinct messages in that interval, and there must be no fewer codewor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Harmonic analysis for a class of multiplicative processes

    Publication Year: 1987, Page(s):16 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    The harmonic analysis of certain multiplicative processes of the formg(t)X(t)is considered, wheregis a deterministic function, and the stochastic processX(t)is of the formX(t)=sum X_{n}l_{[n alpha , (n+l) alpha]}(t), where a is a positive constant and theX_{n}, n=0, pm 1,pm 2, cdotsare independent and identically distributed random variables w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stochastic process associated with the EAR(l) model

    Publication Year: 1987, Page(s):47 - 51
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (565 KB)

    A stochastic bivariate process{(T_{n}, X_{n}): n=0,1,2, cdots }is considered. TheT_{n}are the occurrence times of a random event generated by a Poisson stochastic point process. EachX_{n}is the amplitude associated with thenth event at random timeT_{n}and is constructed fromX_{n}-1and the interarrival timeT_{n}-T_{n-1}, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dichotomy of functionsF(X, Y)of correlated sources(X, Y)

    Publication Year: 1987, Page(s):69 - 76
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1042 KB)

    Consider separate encoding of correlated sourcesX^{n}=(X_{l}, cdots ,X_{n}), Y^{n} = (Y_{l}, cdots ,Y_{n})for the decoder to reliably reproduce a function{F(X_{i}, Y_{i})}^{n}_{i=1}. We establish the necessary and sufficient condition for the set of all achievable rates to coincide with the Slepian-Wolf region whenever the probability densityp(x,y)is positive for a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for constructing inequivalent self-dual codes with applications to length 56

    Publication Year: 1987, Page(s):77 - 82
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (731 KB)

    Necessary and sufficient conditions are presented for two doubly even codes with an automorphism of odd prime order to be equivalent under certain assumptions for the codes. As an application we obtain all extremal doubly even codes of length56with an automorphism of order13. Sixteen such codes are inequivalent. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transform approach to Goppa codes

    Publication Year: 1987, Page(s):105 - 115
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1178 KB)

    Based on a finite Fourier transform of codewords over the finite field GF(q^{m}), some basic properties of the class of Goppa codes are presented. A new lower bound on the minimum distance for these codes is derived and applied to a subclass of Goppa codes which is. in fact. equivalent to a subset of punctured reversible cyclic codes. Furthermore. it is shown how the class of Goppa code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Products of linear recurring sequences with maximum complexity

    Publication Year: 1987, Page(s):124 - 131
    Cited by:  Papers (21)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1022 KB)

    Conditions are derived which guarantee that products of linear recurring sequences attain maximum linear complexity. It is shown that the product of any number of maximum-length GF(q)sequences has maximum linear complexity, provided only the degrees of the corresponding minimal polynomials are distinct and greater than two. It is also shown that if the roots of any number of (not necess... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New permutation codes using Hadamard unscrambling (Corresp.)

    Publication Year: 1987, Page(s):144 - 146
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    A new class of codes for data compression is described that combines permutations with the fast Hadamard transform (FHT). It was invented for digital speech compression based on linear predictive coding (LPC), but may be useful for other data compression applications. One particular code with ratefrac{1}{2}is considered: a16-bit code for a block length of32samples.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic decoding of the (23,12,7) Golay code (Corresp.)

    Publication Year: 1987, Page(s):150 - 151
    Cited by:  Papers (81)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (273 KB)

    It is shown that the algebraic method for decoding three-error-correcting BCH codes is also applicable to complete decoding of the(23,12,7)Golay code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary even [25,15,6] codes do not exist (Corresp.)

    Publication Year: 1987, Page(s):151 - 153
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB)

    That binary even[25,15,6]codes do not exist is proved by passing from coding theory to{bf F}_{2}-affine geometry; all25-sets in{bf F}^{9}_{2}are shown to contain affine planes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On uniform quantization with various distortion measures (Corresp.)

    Publication Year: 1987, Page(s):169 - 171
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB)

    Upper bounds are presented for the difference in entropy between that of a uniform scalar quantizer and that of anyN-dimensional quantizer. The bounds are universal in the sense that they suit every input density and every value of distortion. Bounds were found for some common distortion criteria. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Random Processes: A Mathematical Approach for Engineers' (Gray, R.M., and Davisson, L.D.; 1986)

    Publication Year: 1987, Page(s):172 - 173
    Request permission for commercial reuse | PDF file iconPDF (299 KB)
    Freely Available from IEEE
  • Stability in linear detection

    Publication Year: 1987, Page(s):36 - 46
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1576 KB)

    The stability of linear detectors for signals nominally known except for amplitude in correlated nominally Gaussian noise is considered. Stability is defined in terms of bounds on the distribution of the test statistic as the true probability measure on the observation space varies in a Prokhorov neighborhood of the nominal; the derived stability index is independent of the neighborhood size. An o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal functional expansion for estimation from counting observations

    Publication Year: 1987, Page(s):21 - 35
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1512 KB)

    A systematic method to develop approximate nonlinear estimators is presented, in the form of a functional series, for the signal that modulates the rate of a counting process. The estimators are optimal for the given structure and approach the minimum variance (MV) estimator when the approximation order increases. Two kinds of functional series, the iterated integral (II) series and the Fourier-Ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained Wiener filtering (Corresp.)

    Publication Year: 1987, Page(s):160 - 166
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    As is well-known, the introduction of causality conditions in Wiener filtering problems completely changes their solution. A constraint such as causality can be presented as a particular reduction of the observation space, and the constrained filter can always be obtained by projection onto this space. However, it is sometimes simpler to use an indirect method which gives the impulse response of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encoding and decoding for the minimization of message symbol error rates in linear block codes

    Publication Year: 1987, Page(s):91 - 104
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2200 KB)

    Given any fixed linear block code, the error rates for the message symbols depend both on the encoding function and on the decoding map. This research shows how to optimize the choice of a generator matrix and decoding map simultaneously to minimize the error rates for all message symbols. The model used assumes that the distribution of messages is flat and that the distribution of error vectors d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust detection of signals in dependent noise

    Publication Year: 1987, Page(s):11 - 15
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The robust detection of signals in additive dependent noise is considered. The solution to the finite-sample problem is obtained when the Bayes risk is used as the performance measure. For the multivariate densities involved we assume that they belong to an e-contamination model. The robust detection structure is shown to be optimum for the least-favorable density and is a censored version of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)

    Publication Year: 1987, Page(s):156 - 160
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A new lower bound, which is the tightest possible, is obtained for the redundancy of optimal bimuy prefix-condition (OBPC) codes for a memoryless source for which the probability of the most likely source letter is known. It is shown that this bound, and upper bounds obtained by Gallager and Johnsen, hold for infinite as well as finite source alphabets. Also presented are bounds on the redundancy ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability

    Publication Year: 1987, Page(s):62 - 68
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    Maximum likelihood sequence detection of digital signaling subject to intersymbol interference and additive white Gaussian noise is considered. A new approach to the error probability analysis results in an upper bound which is tighter than the Forney bound. In addition, in the case of infinite-length intersymbol interference a locally convergent bound is shown to hold under fairly general assumpt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic optimality of shortest path routing algorithms

    Publication Year: 1987, Page(s):83 - 90
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    Many communication networks use adaptive shortest path routing. By this we mean that each network link is periodically assigned a length that depends on its congestion level during the preceding period, and all traffic generated between length updates is routed along a shortest path corresponding to the latest link lengths. We show that in certain situations, typical of networks involving a large ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data structure of Huffman codes and its application to efficient encoding and decoding (Corresp.)

    Publication Year: 1987, Page(s):154 - 156
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The data structure of Huffman codes and its application to efficient encoding and decoding of Huffman codes are studied in detail. The tree structure is presented by a two-dimensional array which can be applied for the decoding of Huffman codes as a state transition table of the finite-state decoding automaton. Inversion produces a one-dimensional state transition table of the semiautonomous finit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the nonuniqueness of discretization of two-dimensional probability distribution subject to the maximization of Shannon's entropy (Corresp.)

    Publication Year: 1987, Page(s):166 - 169
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The maximum entropy method has been successfully applied to a number of scientific and engineering disciplines. A special case of its particular usefulness is the discretization of two-dimensional distribution subject to the maximization of Shannon's entropy. Such a discretization scheme provides a means for deriving a Iow-order approximation of probability distribution for mixed-mode (continuous ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotically least-favorable Chernoff bound for a large class of dependent data processes

    Publication Year: 1987, Page(s):52 - 61
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1592 KB)

    It is desired to determine the worst-case asymptotic error probability performance of a given detector operating in an environment of uncertain data dependency. A class of Markov data process distributions is considered which satisfy a one-shift dependency bound and agree with a specified univariate distribution. Within this dependency contamination class the distribution structure which minimizes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using simulated annealing to design good codes

    Publication Year: 1987, Page(s):116 - 123
    Cited by:  Papers (102)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    Simulated annealing is a computational heuristic for obtaining approximate solutions to combinatorial optimization problems. It is used to construct good source codes, error-correcting codes, and spherical codes. For certain sets of parameters codes that are better than any other known in the literature are found. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)

    Publication Year: 1987, Page(s):146 - 150
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Another viewpoint is presented on the derivation of the Berlekamp-Massey algorithm. Our approach differs from previous ones in the following manner. The properties of the shortest linear feedback shift register that generates a given sequence are first derived Without reference to the Berlekamp-Massey algorithm. The Berlekamp-Massey algorithm is then derived using these properties. Our approach ha... 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