By Topic

IEEE Transactions on Information Theory

Issue 3 • May 1969

Filter Results

Displaying Results 1 - 19 of 19
  • A constructive analysis of the aperiodic binary correlation function

    Publication Year: 1969, Page(s):340 - 345
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (901 KB)

    The aperiodic binary correlation function or correlogramX ast Yoccurs as the output of the detector in the correlation detection of a binary code wordYin an unsynchronized code streamX. In most applications, such as self-synchronizing data links, the correlation properties are determined by the desired system characteristics, and the problem is to find codes that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes

    Publication Year: 1969, Page(s):408 - 413
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (730 KB)

    It is shown that ifm neq 8, 12andm > 6, there are some binary primitive BCH codes (BCH codes in a narrow sense) of length2^{m} - 1whose minimum weight is greater than the BCH bound. This gives a negative answer to the question posed by Peterson [1] of whether or not the BCH bound is always the actual minimum weight of a binary primitive BCH code. It is also show... View full abstract»

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

    Publication Year: 1969, Page(s):414 - 418
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (514 KB)

    It is shown that every cyclic code overGF(p)can be decoded up to its minimum distance by a threshold decoder employing general parity checks and a single threshold element. This result is obtained through the application of a general decomposition theorem for complex-valued functions defined on the space of alln-tuples with elements from the ring of integers modulo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "On the mean accuracy of statistical pattern recognizers" by Hughes, G. F.

    Publication Year: 1969, Page(s):420 - 423
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 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.
  • The mean accuracy of pattern recognizers with many pattern classes (Corresp.)

    Publication Year: 1969, Page(s):424 - 425
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (279 KB)

    Hughes [1] presented some curves relating the mean performance of a pattern classifier averaged over all pattern recognition problems of given complexity, when there are two classes of patterns to be distinguished. In this correspondence the mean recognition probability is computed for the case ofqpattern classes when the a priori probabilities of the classes are equal. When the a prior... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general formulation of error matrices (Corresp.)

    Publication Year: 1969, Page(s):425 - 426
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB)

    A general definition of error metrics is given, based on a distance functionmu(a, b)for symbols of the code alphabet, and extended to entire codewords by a Lebesgue normL_{alpha}. It is shown that error metrics considered by Hamming, Lee, Shannon, and Stein are special cases, and a geometric interpretation of the "error spheres" for these metrics is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of a simulated convolutional decoder on measured HF and tropospheric data channels (Corresp.)

    Publication Year: 1969, Page(s):427 - 431
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB)

    A Massey diffuse convolutional decoder was simulated in the IBM7030computer and used to decode binary digital error patterns measured at2400bits/s on an HF radio circuit and on a multiple link data circuit dominated by a tropospheric scatter path. It was found that the simulation performed at least as well as previous cyclic code simulations on HF radio and better than cyclic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design of clutter-resistant radar waveforms with limited dynamic range

    Publication Year: 1969, Page(s):376 - 385
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    The problem of designing radar signals and receivers that are optimum for detecting a point target masked by thermal noise and clutter returns is considered. In a previous paper, the authors described an iterative algorithm for designing such signals subject to an energy constraint. This paper describes an algorithm for the case where the energy constraint is replaced by a dynamic-range constraint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear and quadratic discrimination in pattern recognition (Corresp.)

    Publication Year: 1969, Page(s):419 - 420
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    The class of families of density functions for which linear or quadratic discrimination is optimum is obtained. For linear discrimination, this class is the class of linear exponential families of distributions, for quadratic discrimination it is the class of quadratic exponential families. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A strengthened asymptotic Gilbert bound for convolutional codes (Corresp.)

    Publication Year: 1969, Page(s):433 - 435
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The usual statement of the Gilbert bound is an assertion that at least one member of a given ensemble of codes satisfies a minimum distance criterion. This result is strengthened by showing that for sufficiently large constraint lengths, an arbitrarily large fraction of the ensemble of codes have minimum distance exceeding the usual asymptotic Gilbert bound. New asymptotic bounds are derived for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general formulation of linear feedback communication systems with solutions

    Publication Year: 1969, Page(s):392 - 400
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    The feedback coding problem for additive noise systems, in which the noise may be colored, nonstationary, and correlated between channels, is formulated in terms of arbitrary linear operations at the transmitting and receiving points. This rather general linear formulation provides a unified approach for deriving new results, as well as previous results obtained under more restrictive assumptions,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ternary graph theoretic error-correcting codes (Corresp.)

    Publication Year: 1969, Page(s):435 - 436
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    It is shown that directed graphs can be used to generate a class of moderately efficient error-correcting codes, which are easily decodable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coding theorem for time-discrete analog data sources

    Publication Year: 1969, Page(s):401 - 407
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    The main result of the paper is a coding theorem for time-discrete sources with a fidelity criterion on average distortion. This result applies to a subclass of the ergodic sources (stationary sources having a strong mixing property) and to the cases in which source samples are continuously distributed (analog) quantities or discrete symbols. An intuitive definition of the information content of d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Gilbert burst-error-correcting codes (Corresp.)

    Publication Year: 1969, Page(s):431 - 433
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 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.
  • A series technique for the optimum detection of stochastic signals in noise

    Publication Year: 1969, Page(s):362 - 369
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    A procedure for the optimum detection of stochastic signals in noise is discussed. The optimum test function is expanded in a point-wise convergent series for which a bound on the convergence properties can be obtained. Knowledge of this bound permits the substitution of a truncated version of the series for the optimum test function. This leads to a test procedure that uses a variable number of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust detection using extreme-value theory

    Publication Year: 1969, Page(s):370 - 375
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The use of extreme-value theory (EVT) in the detection of a binary signal in additive, but statistically unknown, noise is considered. It is shown that the optimum threshold and the probability of error of the system can be accurately estimated by using EVT to obtain properties of the initial probability density functions on their "tails." Both constant signals and slowly fading signals are consid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear filtering and piecewise linear correlation functions

    Publication Year: 1969, Page(s):345 - 349
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    For a class of piecewise linear correlation functions, it is shown that optimal linear mean-square filtering is achieved with a finite number of samples of the process for any finite observation interval. The class of correlation functions is defined by a particular property of the points at which they change slope. Conditions are discussed under which an arbitrary piecewise linear function is a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some lower bounds on signal parameter estimation

    Publication Year: 1969, Page(s):386 - 391
    Cited by:  Papers (150)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    New bounds are presented for the maximum accuracy with which parameters of signals imbedded in white noise can be estimated. The bounds are derived by comparing the estimation problem with related optimal detection problems. They are, with few exceptions, independent of the bias and include explicitly the dependence on the a priori interval. The new results are compared with previously known resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general likelihood-ratio formula for random signals in Gaussian noise

    Publication Year: 1969, Page(s):350 - 361
    Cited by:  Papers (176)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1992 KB)

    It is shown that the likelihood ratio for the detection of a random, not necessarily Gaussian, signal in additive white Gaussian noise has the same form as that for a known signal in white Gaussian noise. The role of the known signal is played by the casual least-squares estimate of the signal from the observations. However, the "correlation" integral has to be interpreted in a special sense as an... 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