Scheduled System Maintenance
On Tuesday, January 23, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 2 • April 1966

Filter Results

Displaying Results 1 - 25 of 27
  • Preface to Symposium issue

    Publication Year: 1966, Page(s): 86
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • A practicing statistician looks at the Transactions

    Publication Year: 1966, Page(s):87 - 91
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (901 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum search for the location of the maximum of a unimodal function

    Publication Year: 1966, Page(s):103 - 111
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1376 KB)

    This paper exhibits an optimum strategy for the sequential estimation of, or search for, the location of the maximumMof a unimodal function, whenMis initially uniformly distributed over some interval. The explicit search strategy which is found is valid for a variety of expected cost functions that add the expected cost of observation to the expected cost of terminal decision... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design of point detector arrays--II

    Publication Year: 1966, Page(s):112 - 120
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    This paper considers the design of a detection system to optimally detect known spatially invariant signal fields corrupted by an additive, zero-mean, covariance-separable, and spatially isotropic noise field. The detection system has as its inputnsamples (in a plane) of the signal-plus-noise field; each spatial sample is the output of a point detector. In an earlier paper [1], optimal ... View full abstract»

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

    Publication Year: 1966, Page(s):132 - 134
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB)

    For any prime-powerq, it is shown that there existq-ary convolutional codes with the equidistance property that every code word is at the same distance from all code words disagreeing in the information digits to be decoded. These codes are called "uniform codes" and it is shown that they can be encoded in a very simple manner. The block codes most similar to uniform codes ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes with synchronization capability

    Publication Year: 1966, Page(s):135 - 142
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1153 KB)

    A synchronizable(SC_{s})code has the property that the punctuation (comma or no comma, comma indicating that the next symbol is the beginning of a new code word) at a given position in a code symbol stream can always be determined by observing at mostscode symbols in the neighborhood of the position in question. The construction ofSC_{s}dictionaries and the mechani... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The distribution of the sequential decoding computation time

    Publication Year: 1966, Page(s):143 - 147
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Previous studies of sequential decoding algorithms have shown that the computation time required per decoded digit is small, on the average, when the source rate is less than a rateR_{comp}. In this paper, we consider the probability distribution of the computation time per decoded digit for the Fano algorithm on the binary symmetric channel. We show by underbounding this distribution t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding the vertexes of a graph

    Publication Year: 1966, Page(s):148 - 153
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (806 KB)

    Given a graphGofnnodes. We wish to assign to each nodei(i = 1, 2, cdots n)a unique binary codec_{i}of lengthmsuch that, if we denote the Hannuing distance betweenc_{i}andc_{j}asH(c_{i}, c_{j}), thenH(c_{i}, c_{j})leq Tif nodesiandjare adjacent (i.e., connected by a single branch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of a class of coded and phase-modulated signals

    Publication Year: 1966, Page(s):153 - 161
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1447 KB)

    A system transmits data as phase-modulated signals over a noisy channel. In each ofrsubintervals the carrier phase has one ofppossible values wherepis a prime number. The firstkphase coordinates are specified by the information source while the otherr-kcoordinates are derived through a linear coding scheme in a polynomial field ofM = p^{k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New solutions to the signal design problem for coherent channels

    Publication Year: 1966, Page(s):161 - 167
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (761 KB)

    A fundamental problem of statistical communication theory is that of selecting the optimal set ofMequipowered finite duration waveforms to minimize the error rate for a coherent channel perturbed by white Gaussian noise, the signals being restricted toDdegrees of freedom, whereD < M. It is demonstrated that the concept of placing lower-dimensional regular simpli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further results on the asymptotic complexity of an iterative coding scheme

    Publication Year: 1966, Page(s):168 - 171
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    The purpose of this paper is to demonstrate that it is possible to communicate over a memoryless channel of capacityCat any rateR < Cwith a probability of error less than2^{-E(R)nu},E(R)>0, per block of a length approximately proportional tonu^{2}and with a computational decoding complexity which is asymptotically proportional tonu^{2}wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coding scheme for additive noise channels with feedback--II: Band-limited signals

    Publication Year: 1966, Page(s):183 - 189
    Cited by:  Papers (113)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (667 KB)

    In Part I of this paper, we presented a scheme for effectively exploiting a noiseless feedback link associated with an additive white Gaussian noise channel with {em no} signal bandwidth constraints. We now extend the scheme for this channel, which we shall call the wideband (WB) scheme, to a band-limited (BL) channel with signal bandwidth restricted to(- W, W). Our feedback scheme achi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-corrective character recognition system

    Publication Year: 1966, Page(s):215 - 222
    Cited by:  Papers (37)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (829 KB)

    The output of a simple statistical categorizer is used to improve recognition performance on a homogeneous data set. An array of initial weights contains a coarse description of the various classes; as the system cycles through a set of characters from the same source (a typewritten or printed page), the weights are modified to correspond more closely with the observed distributions. The true iden... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Canonically optimum threshold detection

    Publication Year: 1966, Page(s):230 - 243
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2299 KB)

    A general canonical theory is developed for the systematic approximation of optimum, or Bayes, detection procedures in the critical limiting threshold mode of operation. The approximations to Bayes detectors introduced here are called locally optimum Bayes detectors (LOBD's) and are defined by the condition that they produce the same value of average risk and its derivative for vanishingly small i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Continuous sequential decision in the presence of a finite number of hypotheses

    Publication Year: 1966, Page(s):248 - 255
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1313 KB)

    Given a finite probability spaceXand an a priori distributionP = P(0) = {p_{i}(0)}, exact expressions for minimum search time (to determine the one and only one nonzero mean process) are derived. Only one pointimay be observed at a given time, in contrast to the more standard decision theory problem where all n processes are observed simultaneously. The problem is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of weak signals with polarity coincidence arrays

    Publication Year: 1966, Page(s):260 - 268
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    Polarity Coincidence Array detectors (PCA) are considered for testing the hypothesis that a random signal is common to an array of receivers which contain noise processes that are independent representations of a given class of stochastic processes. A standard procedure is to reduce the received data by sampling and then hard limiting. Hard limiting is shown to introduce an inherent loss in input ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning without a teacher

    Publication Year: 1966, Page(s):223 - 230
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1496 KB)

    This is a review paper discussing and comparing most of the approaches to learning without a teacher which have been suggested to date. The approaches discussed are divided into six classes: guessing a sequence of hypotheses, modifications of this first approach, approximating probability densities by others more easily computed, estimating parameters of a known decision rule, theoretically exact ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for a class of unknown channels

    Publication Year: 1966, Page(s):189 - 195
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    A channel which is selected for each use (without knowledge of past history) to be one of a given set of discrete memoryless channels is to be used by an ignorant communicator, i.e., the transmitter and receiver are assumed to have no knowledge of the particular channels selected. For this situation an upper bound on the insurable average error probability for block codes of length n is obtained w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum filtering and multichannel receivers

    Publication Year: 1966, Page(s):256 - 260
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    We will examine the problem of optimum filtering when signals and noises are incoming on different channels. The filtering is defined by a rectangular matrix of filters and the non-linear operation in the signal processing is the general quadratic system. After the calculation of the output signal-to-noise ratio, we discuss the problem of optimum filtering. In this paper we consider only the solut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified sequential recognition machine using time-varying stopping boundaries

    Publication Year: 1966, Page(s):206 - 214
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    The problem of optimally terminating the sequential recognition procedure at a finite time prespecified by the designer is considered. The application arises, in practice, when the receptor (feature extraction) part of a sequential recognition machine has only a finite number of suitable features available to the categorizer (decision) part, or the cost of taking observation is found too high as t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized minimum distance decoding

    Publication Year: 1966, Page(s):125 - 131
    Cited by:  Papers (323)  |  Patents (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    We introduce a new distance measure which permits likelihood information to be used in algebraic minimum distance decoding techniques. We give an efficient decoding algorithm, and develop exponential bounds on the probability of not decoding correctly. In one application, this technique yields the same probability of error as maximum likelihood decoding. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum recognition of binary signals passed through channels with random parameters

    Publication Year: 1966, Page(s):244 - 248
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    A number of recent papers have investigated optimum reception of signals transmitted through random channels. Some have been so general as to be primarily of academic interest while others have made use of models which, although simple, are rather poor approximations. The treatment in this paper lies between these two extremes. After formulating the problem in the usual way, the investigation proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A system for the automatic recognition of moving patterns

    Publication Year: 1966, Page(s):195 - 205
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB)

    A system for the automatic recognition of two-dimensional patterns is described; recognition taking place as images of the patterns move in a rapid nonstop manner across a stationary scanning unit which takes the form of a bank of photodiodes. Although emphasis is placed on the recognition of alphabetic and numeric characters, the principles developed are applicable to the recognition of more gene... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of coding theory to document retrieval

    Publication Year: 1966, Page(s):92 - 96
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    In this paper, methods for document retrieval are derived from algebraic coding theory. It is shown that these methods are efficient in information representation and that the amount of computation required in implementation is quite reasonable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear transformations of the ambiguity function

    Publication Year: 1966, Page(s):120 - 125
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The radar ambiguity function is useful as a criterion of goodness for modulation signals used to discriminate the range and range-rate of point targets. It is often desirable to change existing ambiguity functions to meet new specifications of resolvability. One way of accomplishing this task is by using linear transformations of the ambiguity function. A review of the properties of ambiguity func... 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