By Topic

IEEE Transactions on Information Theory

Issue 4 • July 1974

Filter Results

Displaying Results 1 - 22 of 22
  • Hypothesis testing and information theory

    Publication Year: 1974, Page(s):405 - 417
    Cited by:  Papers (121)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1660 KB)

    The testing of binary hypotheses is developed from an information-theoretic point of view, and the asymptotic performance of optimum hypothesis testers is developed in exact analogy to the asymptotic performance of optimum channel codes. The discrimination, introduced by Kullback, is developed in a role analogous to that of mutual information in channel coding theory. Based on the discrimination, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When should a learning machine ask for help?

    Publication Year: 1974, Page(s):455 - 471
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2867 KB)

    We present a view of the learning phase of statistical pattern recognition as a problem in optimum mode switching for learning systems which can operate in the supervised and nonsupervised modes. We assume the standardJ-category statistical pattern recognition model, in which patterns are represented as points in Euclideann-space and the learning problem is to estimate the un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bibliography on estimation of misclassification

    Publication Year: 1974, Page(s):472 - 479
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1622 KB)

    Articles, books, and technical reports on the theoretical and experimental estimation of probability of misclassification are listed for the case of correctly labeled or preclassified training data. By way of introduction, the problem of estimating the probability of misclassification is discussed in order to characterize the contributions of the literature. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the error probability in decision-feedback equalization

    Publication Year: 1974, Page(s):490 - 497
    Cited by:  Papers (125)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (842 KB)

    An upper bound on the error probability of a decision-feedback equalizer which takes into account the effect of error propagation is derived. The bound, which assumes independent data symbols and noise samples, is readily evaluated numerically for arbitrary tap gains and is valid for multilevel and nonequally likely data. One specific result for equally likely binary symbols is that if the worst c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital transmission with coherent four-dimensional modulation

    Publication Year: 1974, Page(s):497 - 502
    Cited by:  Papers (24)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (798 KB)

    This paper examines codes for four-dimensional (4-D) modulation and their performance for digital transmission. The signals are defined byMpoints inside a sphere in four-dimensional Euclidian space. Three classes of 4-D codes are presented, and an algorithm is given which yields good 4-D codes of any length. Bounds on symbol error probability are plotted versus symbol-energy-to-noise-de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On theepsilon-entropy and the rate-distortion function of certain non-Gaussian processes

    Publication Year: 1974, Page(s):517 - 524
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1085 KB)

    Letxi = {xi(t), 0 leq t leq T}be a process with covariance functionK(s,t)andE int_0^T xi^2(t) dt < infty. It is proved that for everyvarepsilon > 0thevarepsilon-entropyH_{varepsilon}(xi)satisfies begin{equation} H_{varepsilon}(xi_g) - mathcal{H}_{xi_g} (xi) leq H_{varepsilon}(xi) leq H_{varepsilon}(xi_g) end{equation} where View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further results on decoders forQ-ary output channels (Corresp.)

    Publication Year: 1974, Page(s):552 - 554
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Decoders for channels with an alphabetAand an output alphabetAprime supseteq Aare given. It is shown that, whenA = View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Markov Processes and Learning Models' (Norman, M. F.; 1972)

    Publication Year: 1974, Page(s):562 - 563
    Request permission for commercial reuse | PDF file iconPDF (454 KB)
    Freely Available from IEEE
  • Source coding theorems without the ergodic assumption

    Publication Year: 1974, Page(s):502 - 516
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2312 KB)

    Source coding theorems are proved for discrete-time stationary processes subject to a fidelity criterion. The alphabet of the process is assumed to be a separable metric space, but the process is not assumed to be ergodic. When the process is not ergodic, the minimum average distortion for a fixed-rate code is not given by the distortion-rate function of the source as usually defined. It is given ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.)

    Publication Year: 1974, Page(s):544 - 549
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Transmission of a time-discrete message over a time-continuous channel is considered. The channel is assumed to be stationary and Gaussian. The following results are shown. 1) An optimum receiver will always contain a matched matrix filter followed by a sampling unit. 2) Jointly optimized transmitting and receiving filters will always be strictly band limited to a set of Nyquist domains. It is sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-memory problems and algorithms

    Publication Year: 1974, Page(s):440 - 455
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2312 KB)

    A formulation of finite-memory information processing problems is presented. The total state space of the system, including the "memory" of the source and processor, is assumed to be finite. A cost functional is specified over the trajectories of the system and a variational approach is used to minimize cost. There results a two-point boundary value problem and an associated improvement algorithm.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic selection of reference data for use in a nearest-neighbor method of pattern classification (Corresp.)

    Publication Year: 1974, Page(s):541 - 543
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    Two methods for automatic selection of nearest-neighbor reference data have been compared in small-scale experimentation. One of the methods is original and appears to be more successful than Hart's well-known "condensed nearest-neighbor" method [1]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction method for path-invariant comma-free codes (Corresp.)

    Publication Year: 1974, Page(s):555 - 559
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    Many classes of comma-free codes have been proposed. Among them, path-invariant comma-free codes have the advantage of relative simplicity of encoding and decoding. In this correspondence, we present a construction method for these codes which is a unified generalization of the known construction methods. By this method some new classes of path-invariant comma-free codes are obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A likelihood ratio formula for two-dimensional random fields

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

    This paper is concerned with the detection of a random signal in white Gaussian noise when both the signal and the noise are two-dimensional random fields. The principal result is the derivation of a recursive formula for the likelihood ratio relating it to certain conditional moments of the signal. It is also shown that, except for some relatively uninteresting cases, a simple exponential formula... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modification of Huffman's impulse-equivalent pulse trains to increase signal energy utilization (Corresp.)

    Publication Year: 1974, Page(s):559 - 561
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    It is shown by several examples that if D. A. Huffman's pulse train design is modified to allow one nonzero pair of sidelobes in addition to the unavoidable end sidelobes in the autocorrelation function, then a substantial increase in the central peak for the same maximum pulse energy can be achieved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the probability of decoding error for the finite-state channel (Corresp.)

    Publication Year: 1974, Page(s):549 - 551
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    A new lower bound on the probability of decoding error for transmission at high rates over a finite-state channel is obtained. It is a dual to the random coding bound of Yudkin and is a generalization of the Arimoto converse to the coding theorem for discrete memoryless channels. It also implies the strong converse to the coding theorem for indecomposable channels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derivation and evaluation of improved tracking filter for use in dense multitarget environments

    Publication Year: 1974, Page(s):423 - 432
    Cited by:  Papers (132)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1584 KB)

    When tracking targets in dense environments, sensor reports originating from sources other than the target being tracked (i.e., from clutter, thermal false alarms, other targets) are occasionally incorrectly used in track updating. As a result tracking performance degrades, and the error covariance matrix calculated on-line by the usual types of tracking filters becomes extremely unreliable for es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effects of a visual fidelity criterion of the encoding of images

    Publication Year: 1974, Page(s):525 - 536
    Cited by:  Papers (531)  |  Patents (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2832 KB)

    Shannon's rate-distortion function provides a potentially useful lower bound against which to compare the rate-versus-distortion performance of practical encoding-transmission systems. However, this bound is not applicable unless one can arrive at a numerically-valued measure of distortion which is in reasonable correspondence with the subjective evaluation of the observer or interpreter. We have ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum transmitting filter in digital PAM systems with a Viterbi detector

    Publication Year: 1974, Page(s):479 - 489
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 KB)

    Optimization of the transmitting filter in a PAM system using a Viterbi detector of constrained complexity is considered. The receiving filter is considered to be a whitened matched filter. A constraint on detector complexity is obtained by limiting the length of the system impulse response. The results are applied to a channel with coaxial cable characteristics. Comparison with other detectors sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The probability density function for the output of an analog cross-correlator with correlated bandpass inputs

    Publication Year: 1974, Page(s):433 - 440
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    The probability density function (pdf) for the output of an analog cross-correlator with correlated bandpass inputs is derived. The pdf is derived by a "direct method" without resorting to the "characteristic function method," which usually requires contour integrations in a complex plane for inversion operations. The correlator consists of bandpass filters, a multiplier, and a zonal low-pass filt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust detection to stochastic signals (Corresp.)

    Publication Year: 1974, Page(s):537 - 541
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    In this correspondence we evaluate both the large and small sample performance of a limiter-quadratic detector (LQD) for the detection of a Gaussian signal in non-Gaussian noise. The LQD is shown to be robust for small as well as large sample sizes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating cyclically permutable codes (Corresp.)

    Publication Year: 1974, Page(s):554 - 555
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    Large sets of cyclically permutable (or cyclically inequivalent) codewords can be created by interleaving the cyclic shifts of several shorter words and selecting a cyclically inequivalent subset from the resulting set, This correspondence presents an efficient algorithm for generating the cyclically inequivalent subset directly. 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