IEEE Transactions on Information Theory

Volume 36 Issue 2 • March 1990

Filter Results

Displaying Results 1 - 25 of 29
  • Quantization for decentralized hypothesis testing under communication constraints

    Publication Year: 1990, Page(s):241 - 255
    Cited by:  Papers (123)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1337 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.
  • Comparison of two optimum rates for noiseless encoding of a nonstationary information source

    Publication Year: 1990, Page(s):256 - 261
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    A nonstationary finite-alphabet information source mu is noiselessly encoded, first by adaptive block to variable-length codes and then by finite-state codes of this kind. It is shown that if mu belongs to a certain class of sources that includes those with finite-order Markov memory, then a stationary input-restricted channel exists such that in the first case the optimum encoding rate is equal t... 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 (1090 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.
  • The entropy of ordered sequences and order statistics

    Publication Year: 1990, Page(s):276 - 284
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (619 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.
  • 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 (262 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 of two values.<<ETX&... 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 (25)  |  Patents (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (574 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.
  • Mismatched DPCM encoding of autoregressive processes

    Publication Year: 1990, Page(s):296 - 304
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 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.
  • On the continuity of the stationary state distribution of DPCM

    Publication Year: 1990, Page(s):305 - 311
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (646 KB)

    Continuity and singularity properties of the stationary state distribution of differential pulse code modulation (DPCM) are explored. Two-level DPCM (i.e. delta modulation) operating on a first-order autoregressive source is considered, and it is shown that, when the magnitude of the DPCM prediction coefficient is between zero and one-half, the stationary state distribution is singularly continuou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New criteria for blind deconvolution of nonminimum phase systems (channels)

    Publication Year: 1990, Page(s):312 - 321
    Cited by:  Papers (613)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (753 KB)

    A necessary and sufficient condition for blind deconvolution (without observing the input) of nonminimum-phase linear time-invariant systems (channels) is derived. Based on this condition, several optimization criteria are proposed, and their solution is shown to correspond to the desired response. These criteria involve the computation only of second- and fourth-order moments, implying a simple t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limiting performance of frequency-hop random access

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

    The multiple-access capability of asynchronous frequency-hop packet-radio networks is analyzed. The only interference considered is multiple-access interference, and perfect side information is assumed. Bounds on the probability of error for unslotted systems are developed based on the distributions of the maximum and minimum interference levels over the duration of a given packet, and these are e... 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 (1364 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 accuracy, of th... 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 (828 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.
  • 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 (959 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.
  • 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 (851 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.
  • The hardness of decoding linear codes with preprocessing

    Publication Year: 1990, Page(s):381 - 385
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (442 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.
  • Design of test sequences for VLSI self-testing using LFSR

    Publication Year: 1990, Page(s):386 - 392
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 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 general LFSR, and in par... 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 (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 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.<<ETX>> 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 (198 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.<<ETX>> 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 (376 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<or=5 all orphans of R(1, m) are identified.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear time adaptive arithmetic coding

    Publication Year: 1990, Page(s):401 - 406
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 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.<<ETX>> 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 (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB)

    In a balanced code each codeword contains equally many 1's and 0's. Parallel decoding balanced codes with 2/sup r/ (or 2/sup r/-1) information bits are presented, where r is the number of check bits. The 2/sup 2/-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 used.<<ETX>> 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 (440 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.<<ETX>> 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 (394 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.
  • Doubly adaptive DPCM

    Publication Year: 1990, Page(s):414 - 420
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (702 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.
  • 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 (677 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.

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