IEEE Transactions on Information Theory

Volume 19 Issue 4 • July 1973

Filter Results

Displaying Results 1 - 25 of 36
  • A survey of coding theory: 1967-1972

    Publication Year: 1973, Page(s):381 - 389
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1711 KB)

    The coding theory literature for the period 1967-1972 is surveyed. Four contributions considered to be of special merit are identified. A brief description of several books solely concerned with coding theory is presented. The major themes reflected in selected English-language journals are outlined. More than 100 references are cited to illustrate these themes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution of point sources of light as analyzed by quantum detection theory

    Publication Year: 1973, Page(s):389 - 398
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1426 KB)

    The resolvability of point sources of incoherent thermal light is analyzed by quantum detection theory in terms of two hypothesis-testing problems. In the first, the observer must decide whether there are two sources of equal radiant power at given locations, or whether there is only one source of twice the power located midway between them. In the second problem, either one, but not both, of two ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The recovery of distorted band-limited stochastic processes

    Publication Year: 1973, Page(s):398 - 403
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (831 KB)

    This paper deals with the problem of recovering a band-limited process after it has been distorted by an instantaneous non-linearity and subsequently band-limited. Several uniqueness theorems for the input-output relationships are derived. In contrast with the deterministic case, no requirement that the nonlinearity be monotonic is made here. An iterative procedure for the recovery of the input is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a nonlinear problem involving<tex>RC</tex>noise

    Publication Year: 1973, Page(s):404 - 411
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1065 KB)

    The problem of determining the first-order probability density of a filtered version of hard-limited<tex>RC</tex>noise is considered. An integral equation for the density is derived by using Siegert's results on zero-crossing distributions for<tex>RC</tex>noise. We also show how the integral equation can be obtained from a two-dimensional Fokker-Planck equation. The exact s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distribution and moments of<tex>RC</tex>-filtered hard-limited<tex>RC</tex>-filtered white noise

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

    Suppose white noise is put into an<tex>RC</tex>filter with time constant<tex>1/a</tex>whose output is hard limited and fed into a second<tex>RC</tex>filter with time constant<tex>1/b</tex>. The density of the output<tex>y(t)</tex>of the system has been the subject of several investigations. Most recently, Pawula and Tsai made the conjectu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On nonlinear filters involving transformation of the time variable

    Publication Year: 1973, Page(s):415 - 422
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (927 KB)

    A new type of nonlinear filter, called the<tex>E</tex>-filter, is introduced that involves a transformation of the independent variable of the input function. It is shown how an<tex>E</tex>-filter can be designed to filter out superimposed "noise" on a signal, leaving the large peaks of the signal unattenuated. Unlike a Iow-pass linear filter, the low-pass<tex>E</t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Invariant Gauss-Gauss detection

    Publication Year: 1973, Page(s):422 - 427
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (782 KB)

    The detection of information-bearing Gaussian processes immersed in additive white Gaussian noise (WGN) is an important problem that arises in many signal processing applications. When the level of the WGN is unknown, classical approaches to the problem fail. In this paper a principle of invariance is used to derive a detector with performance that is invariant (or insensitive) to system gain, or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential non-Gaussian pattern recognition with supervised learning

    Publication Year: 1973, Page(s):428 - 433
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (798 KB)

    This paper considers binary pattern recognition of a non-Gaussian pattern in Gaussian noise using supervised learning. The scheme is both structure and parameter adaptive. To facilitate a feasible solution, certain judicious approximations are used. Two examples are presented to demonstrate the learning capability of the proposed algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric Bayes error estimation using unclassified samples

    Publication Year: 1973, Page(s):434 - 440
    Cited by:  Papers (54)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    A new nonparametric method of estimating the Bayes risk using an unclassified test sample set as well as a classified design sample set is introduced. The classified design set is used to obtain nonparametric estimates of the conditional Bayes risk of classification at each point of the unclassified test set. The average of these risk estimates is the error estimate. For large numbers of design sa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharp error bounds for intersymbol interference

    Publication Year: 1973, Page(s):440 - 447
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1042 KB)

    Sharp upper and lower bounds of the Chebyshev type are established for the probability of error due to intersymbol interference and additive Gaussian noise in a digital communication system. The results are in relatively closed form, and the only statistical knowledge assumed about the interference is the peak eye opening and the variance. The bounds apply to correlated and uncorrelated signals an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive receiver for data transmission over time-dispersive channels

    Publication Year: 1973, Page(s):448 - 457
    Cited by:  Papers (109)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1427 KB)

    Optimum nonlinear receivers for digital signaling over channels with a relatively long impulse response become too complex to be practical. In this paper a suboptimum but simple and practical receiver is proposed for such channels. The receiver consists of a linear adaptive equalizer in cascade with a maximum-likelihood sequence estimator. A general method of finding the error probability of a max... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-distortion bound on channel requirements for transmission of parameters of adaptive predictive coders, with speech applications

    Publication Year: 1973, Page(s):458 - 471
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1848 KB)

    A nonstationary signal source can be decomposed into subsources if it exhibits certain characteristics. Adaptive predictive coding is considered as a method of extracting these subsources from the composite source in such a way that the overall communication problem can then be viewed as two different, but connected, communication problems: 1) transmission of predictor parameters, and 2) transmiss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noiseless coding of correlated information sources

    Publication Year: 1973, Page(s):471 - 480
    Cited by:  Papers (2329)  |  Patents (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1379 KB)

    Correlated information sequences<tex>\cdots ,X_{-1},X_0,X_1, \cdots</tex>and<tex>\cdots,Y_{-1},Y_0,Y_1, \cdots</tex>are generated by repeated independent drawings of a pair of discrete random variables<tex>X, Y</tex>from a given bivariate distribution<tex>P_{XY} (x,y)</tex>. We determine the minimum number of bits per character<tex>R_X</tex&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new class of lower bounds to information rates of stationary sources via conditional rate-distortion functions

    Publication Year: 1973, Page(s):480 - 489
    Cited by:  Papers (69)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1437 KB)

    A new class of lower bounds to rate-distortion functions of stationary processes with memory and single-letter vector-valued distortion measures is derived. This class is shown to include or imply all other well-known lower bounds to rates of such sources and distortion measures. The derivation is based on the definition and properties of the conditional rate-distortion function. In addition to pr... View full abstract»

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

    Publication Year: 1973, Page(s):490 - 498
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1192 KB)

    We present a new derivation of the source coding theorem for discrete-time sources. This proof parallels Gallager's [1] derivation of the random coding bound for channel coding theory and shows that the classical random coding exponent also emerges as a critical quantity for source coding. The major advantage of this approach is the simplicity of the derivation and its close relationship to the mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the error probability for a class of binary recursive feedback strategies

    Publication Year: 1973, Page(s):498 - 511
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1944 KB)

    The error probability for a class of binary recursive feedback strategies is evaluated. An exact analysis is given for both a nonsequential and a sequential decision strategy. We obtain the interesting result that even for the nonsequential receiver the error probability vanishes exponentially fast at channel capacity. A similar result had been previously obtained by Horstein for the sequential re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural analysis of convolutional codes via dual codes

    Publication Year: 1973, Page(s):512 - 518
    Cited by:  Papers (84)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    A linear correspondence is developed between the states of a rate-<tex>k/n</tex>convolutional encoder<tex>G</tex>and the states of a corresponding syndrome former<tex>H^T</tex>, where<tex>H</tex>is an encoder of the code dual to the code generated by<tex>G</tex>. This correspondence is used to find an expression for the number of all-zero... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Search properties of some sequential decoding algorithms

    Publication Year: 1973, Page(s):519 - 526
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1169 KB)

    Sequential decoding procedures are studied in the context of selecting a path through a tree. Several algorithms are considered and their properties compared. It is shown that the stack algorithm introduced by Zigangirov and by Jelinek is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the construction of<tex>N</tex>-ary orthogonal sequences under a continuous-phase constraint

    Publication Year: 1973, Page(s):527 - 532
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB)

    Given the alphabet<tex>A = \{ \pm a_0, \cdots, \pm a_i, \cdots, \pm a_{N-1} \}</tex>the problem investigated is the construction of the largest set of mutually orthogonal sequences of length<tex>n</tex>under the following constraint on the form of the sequences. Each sequence is a concatenation of<tex>n</tex>elements from<tex>A</tex>but not all conca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inequalities between the probability of a subspace and the probabilities of its cosets

    Publication Year: 1973, Page(s):533 - 536
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    We consider an<tex>n</tex>-dimensional vector space over<tex>GF(q)</tex>which has a probability distribution defined on it. The sum of the probabilities over a proper<tex>k</tex>-dimensional subspace is compared to a sum over a coset of this subspace. The difference of these set probabilities is related to a sum of the Fourier transforms of the distribution over... View full abstract»

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

    Publication Year: 1973, Page(s):537 - 548
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1968 KB)

    This paper presents a class of majority-logic decodable codes whose structure is based on the structural properties of Euclidean geometries (EG) and codes that are invariant under the affine group of permutations. This new class of codes contains the ordinary EG codes and some generalized EG codes as subclasses. One subclass of new codes is particularly interesting: they are the most efficient maj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding by sequential code reduction

    Publication Year: 1973, Page(s):549 - 555
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1034 KB)

    A general decoding method for cyclic codes is presented which gives promise of substantially reducing the complexity of decoders at the cost of a modest increase in decoding time (or delay). Significant reductions in decoder complexity for binary cyclic finite-geometry codes are demonstrated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of asymptotically memoryless continuous-time channels (Corresp.)

    Publication Year: 1973, Page(s):556 - 557
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB)

    Previously, a coding theorem and its converse for stationary asymptotically memoryless continuous-time channels were proved, giving the capacity<tex>C</tex>with an almost sure constraint on the input cost. For calculation, it is more convenient to find a capacity<tex>\bar{C}</tex>with the constraint on the expected input cost. Obviously,<tex>C \leq \bar{C}</tex>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the zero-error capacity of a noisy channel with feedback (Corresp.)

    Publication Year: 1973, Page(s):557 - 559
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (457 KB)

    It is shown by Shannon that the zero-error capacity of a noisy channel may be increased with feedback. However, feedback cannot improve the zero-error capacity of all memoryless channels. The graphs of discrete memoryless channels are classified on the basis of whether feedback increases the zero-error capacity or not. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Barankin bound: A geometric interpretation (Corresp.)

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

    It is well known that the Barankin bound is locally the tightest lower bound on the variance of any unbiased estimator. If the minimum-variance unbiased-parameter estimation problem is viewed as a minimum-norm problem in an appropriate Hilbert space, the Barankin bound has a very simple geometric interpretation. This interpretation also gives some insight into the influence of bias on the estimati... 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