IEEE Transactions on Information Theory

Issue 2 • Mar 1990

Filter Results

Displaying Results 1 - 25 of 29
  • Linear time adaptive arithmetic coding

    Publication Year: 1990, Page(s):401 - 406
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The issue of how arithmetic coding should be implemented is addressed. A data structure is described and shown to support adaptive arithmetic coding on an arbitrary-sized alphabet in time linear in the size of the inputs and outputs. Experimental results that show the method to be useful even on relatively small alphabets are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orphans of the first order Reed-Muller codes

    Publication Year: 1990, Page(s):399 - 401
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    If C is a code, an orphan is a coset that is not a descendant. Orphans arise naturally in the investigation of the covering radius. Case C has only even-weight vectors and minimum distance of at least four. Cosets that are orphans are characterized, and then the existence is proved of a family of orphans of first-order Reed-Muller codes R(1, m). For m&l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the order of a FIR filter for noise cancellation

    Publication Year: 1990, Page(s):429 - 434
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    The problem of designing a finite impulse response filter devoted to the joint process problem, and in particular to noise cancellation, is investigated. The goal is restricted to how to choose an optimal order of the FIR filter. The analysis is based on the maximization of a noise reduction criterion which is in fact perfectly matched to the desired performance, namely the minimization of residua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large deviation rate calculations for nonlinear detectors in Gaussian noise

    Publication Year: 1990, Page(s):358 - 371
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (796 KB)

    An asymptotic analysis based on large deviation theory is presented for three representative nonlinear receivers operating in the presence of Gaussian noise, namely radiometers, differential phase shift keying, and memoryless detectors. En route to the results an extension to the Toeplitz distribution theorem is proved. This extension provides the key to obtaining closed-form expressions for the e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The true dimension of certain binary Goppa codes

    Publication Year: 1990, Page(s):397 - 398
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    By applying a result from algebraic geometry due to E. Bombieri (Amer. J. Math., vol.88, p.71-105, 1966), the true dimension of certain binary Goppa codes is calculated. The results lead in many cases to an improvement of the usual lower bound for the dimension View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust matched filters for noise uncertainty within two alternating capacity classes

    Publication Year: 1990, Page(s):426 - 429
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    The problem of designing matched filters that are robust against uncertainty in the statistics of a noise process modeled by two alternating Choquet capacities is addressed. The robust design is based on the maximum signal-to-noise ratio. The problem is formulated and solved for both discrete-time and continuous-time matched filters with uncertainty in either the autocorrelation function or the sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The entropy of ordered sequences and order statistics

    Publication Year: 1990, Page(s):276 - 284
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    The entropy of a sequence of random variables under order restrictions is examined. A theorem that shows the amount of entropy reduction when the sequence is ordered is presented. Upper and lower bounds to the entropy reduction and conditions under which they are achieved are derived. Some interesting properties of the entropy of the individual order statistics are also presented. It is shown that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonlinear optimum-detection problem. I. Theory

    Publication Year: 1990, Page(s):347 - 357
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    An approximate log-likelihood ratio for detecting a deterministic signal in linear and nonlinear Gaussian noise is derived. The new aspect of this detection problem is the inclusion of a nonlinear form of Gaussian noise and a certain interaction between the signal and the linear noise, such as modulation of the signal by the noise. The derived log-likelihood ratio consists of a modified version of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hardness of decoding linear codes with preprocessing

    Publication Year: 1990, Page(s):381 - 385
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB)

    The problem of maximum-likelihood decoding of linear block codes is known to be hard. The fact that the problem remains hard even if the code is known in advance, and can be preprocessed for as long as desired in order to device a decoding algorithm, is shown. The hardness is based on the fact that existence of a polynomial-time algorithm implies that the polynomial hierarchy collapses. Thus, some... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On computing the minimum distance for faster than Nyquist signaling

    Publication Year: 1990, Page(s):289 - 295
    Cited by:  Papers (19)  |  Patents (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    The degradation suffered when pulses satisfying the Nyquist criterion are used to transmit binary data at a rate faster than the Nyquist rate over the ideal band-limited (brick-wall) channel is studied. The minimum distance between received signals is used as a performance criterion. It is well-known that when Nyquist pulses (i.e. pulses satisfying the Nyquist criterion) are sent at the Nyquist ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the number of spurious memories in the Hopfield model [neural network]

    Publication Year: 1990, Page(s):393 - 397
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    The outer-product method for programming the Hopfield model is discussed. The method can result in many spurious stable states-exponential in the number of vectors that are to be stored-even in the case when the vectors are orthogonal View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a stack algorithm for CSMA-CD random length packet communication

    Publication Year: 1990, Page(s):420 - 426
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    An exact performance evaluation of the free-access stack collision resolution algorithm is given under the hypotheses of carrier-sense multiple access with collision detection (CSMA-CD) local area network communication with packets of different length. In particular, the packet delay moments (mean and variance) and the maximum throughput that the system achieves for any given packet length distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional perfect binary arrays with 64 elements

    Publication Year: 1990, Page(s):411 - 414
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    Perfect binary arrays can exist for numbers of elements that are even square numbers. Two-dimensional (2-D) perfect binary arrays are 4, 16, 36, and 144 elements are known. Perfect binary arrays with 64 elements can be constructed for three or more dimensions. Here, two-dimensional binary arrays with 64 elements are examined. The results of computer search for symmetric binary arrays with 64 eleme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the deterministic-code capacity of the multiple-access arbitrarily varying channel

    Publication Year: 1990, Page(s):262 - 275
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    A method that allows one to decide whether or not the capacity region of a multiple-access arbitrarily varying channel (AVC) has a nonempty interior is discussed. Using the method of types and an approach different from J.H. Jahn (ibid. vol.27, no.3, p.212-226, 1981) this problem is partially solved. The notion of symmetrizability for the two-user AVC as an extension of the same notion for the sin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steady-state behavior of interacting queues-a numerical approach

    Publication Year: 1990, Page(s):334 - 346
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1148 KB)

    The M queues that interact according to a model of multiple-access transmissions over a collision channel are considered. Each queue receives messages that it attempts to transmit in a classical slotted ALOHA fashion. The steady-state behavior of such systems is unknown except in certain simple cases. A numerical approach is proposed that permits the calculation, within any desired accura... View full abstract»

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

    Publication Year: 1990, Page(s):406 - 408
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    In a balanced code each codeword contains equally many 1's and 0's. Parallel decoding balanced codes with 2r (or 2r -1) information bits are presented, where r is the number of check bits. The 22-r-1 construction given by D.E. Knuth (ibid., vol.32, no.1, p.51-3, 1986) is improved. The new codes are shown to be optimal when Knuth's complementation method is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nonlinear optimum-detection problem. II. Simple numerical examples

    Publication Year: 1990, Page(s):434 - 439
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    For pt.I see ibid., vol.36, no.2, p.347-57 (1990). Simple numerical examples are presented to illustrate the effect of the previously derived nonlinear filters for combating nonlinear Gaussian noise in detecting deterministic signals. The nonlinear Gaussian noise is expressed as a quadratic form in stationary Gaussian noise that is also present in the data, together with white Gaussian noise. Thus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relations between modeling approaches for speech recognition

    Publication Year: 1990, Page(s):372 - 380
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    Some relations among approaches that have been applied to estimating models for acoustic signals in speech recognition systems are examined. In particular, the modeling approaches based on maximum likelihood (ML), maximum mutual information (MMI), and minimum discrimination information (MDI) are studied. It is shown that all three approaches can be formulated uniformly as MDI modeling approaches f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the diameter of a class of random graphs

    Publication Year: 1990, Page(s):285 - 288
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    The diameter of a class of random directed graphs in which the outdegree of each vertex is constrained to be exactly k is examined. Vertices connect themselves to k other distinct vertices with outwardly directed edges, all possible sets of k vertices being chosen with equal probability. It is shown that the diameter of such a random graph almost surely takes on only one... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of test sequences for VLSI self-testing using LFSR

    Publication Year: 1990, Page(s):386 - 392
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Consider a shift register (SR) of length n and a collection of designated subsets of {0,1, . . ., n-1}. The problem is how to add feedback to the SR such that the resulting linear feedback shift register (LFSR) exercises (almost) exhaustively each of the designated subsets and is of small period. Several previously known results for maximum-length LFSR are extended to more genera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mismatched DPCM encoding of autoregressive processes

    Publication Year: 1990, Page(s):296 - 304
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    A method for computing the mean squared error distortion of differential pulse code modulation (DPCM) applied to Gaussian autoregressive sources is developed. This extends previous work wherein the code predictor was matched to the source. A two-dimensional version of the projection method for the computation of the stationary distribution of the joint source-state process is developed from which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization for decentralized hypothesis testing under communication constraints

    Publication Year: 1990, Page(s):241 - 255
    Cited by:  Papers (107)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1132 KB)

    In a decentralized hypothesis testing network, several peripheral nodes observe an environment and communicate their observations to a central node for the final decision. The presence of capacity constraints introduces theoretical and practical problems. The following problem is addressed: given that the peripheral encoders that satisfy these constraints are scalar quantizers, how should they be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Doubly adaptive DPCM

    Publication Year: 1990, Page(s):414 - 420
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    An adaptive differential pulse code modulation (DPCM) algorithm is presented that determines, for each window, the best causal nonsymmetric half-plane region of support (ROS) in addition to the best prediction coefficients. First, a recursive algorithm is developed that determines the best (in the sense of minimizing the mean-square error) first-, second-, and third-order ROS from the covariance m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Another generalized Golomb-Posner code

    Publication Year: 1990, Page(s):408 - 411
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    Through the use of mutually orthogonal frequency squares, a generalization of the original Golomb-Posner code is constructed. The minimum distance and weight distribution of the generalized code when it is constructed from a complete set of orthogonal squares over a finite field are also determined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The minimum codeword length and redundancy in the binary Huffman code for uncertain sources

    Publication Year: 1990, Page(s):439 - 443
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    Bounds to the length of the shortest codeword in a binary Huffman code are obtained. Among them are bounds assuming knowledge of different subsets of the probability distribution. Each is shown to be the tightest possible bound for the subset of probabilities it presumes. Two lower bounds to the redundancy of the Huffman code are also obtained. They are also shown to be the tightest possible bound... 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