By Topic

IEEE Transactions on Information Theory

Issue 4 • Date July 1970

Filter Results

Displaying Results 1 - 25 of 39
  • Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.)

    Publication Year: 1970, Page(s):509 - 510
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 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.
  • Review of 'An Introduction to Statistical Communication Theory' (Thomas, J. B.; 1969)

    Publication Year: 1970, Page(s):514 - 515
    Request permission for commercial reuse | PDF file iconPDF (404 KB)
    Freely Available from IEEE
  • Review of 'Notes on Digital Communication' (Turin, G. L.; 1969)

    Publication Year: 1970, Page(s): 515
    Request permission for commercial reuse | PDF file iconPDF (170 KB)
    Freely Available from IEEE
  • On the detection of a sudden change in system parameters

    Publication Year: 1970, Page(s):497 - 500
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    This correspondence deals with the problem of detecting a sudden change in system parameters by means of noisy observations made on the system. The solution given here is dependent on the classical Bayes criterion. However, by forming an auxiliary sequence of O's and l's as the observations are taken, it is shown, at most, three log-likelihood numbers need to be updated recursively at any stage. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information channel capacity of a photographic film (Corresp.)

    Publication Year: 1970, Page(s):477 - 480
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    A different approach toward the information channel capacity of a photographic film is presented. It is based on the total number of possible combinations of the smallest distinguishable regions in a piece of photographic film. The information channel capacity of a hologram is also discussed. It is found that the information capacity of a hologram is somewhat lower than that of a photographic film... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Another recursive method of computing the Q function (Corresp.)

    Publication Year: 1970, Page(s):500 - 501
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 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.
  • Rate-distortion function for a Gaussian source model of images (Corresp.)

    Publication Year: 1970, Page(s):507 - 509
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    Still pictures can be modeled as realizations of a two-dimensional random field. Similarly, pictures that unfold with time across an aperture can be modeled as realizations of three-dimensional fields. Correlated sources can be found by looking at different regions of the spectrum or at different areas of a picture. Under the assumption that the sources are Gaussian a method is presented for findi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further results on cyclic product codes

    Publication Year: 1970, Page(s):452 - 459
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    Cyclic product codes are useful for two reasons. First, they impart a great deal of algebraic structure to a subclass of the class of cyclic codes. Second, because they can be formulated in terms of much shorter (component) codes, their decoding may be considerably simpler than many other types of codes. In this paper both of the properties of cyclic product codes are developed. It is shown that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal-design considerations for the noncoherent Gaussian channel (Corresp.)

    Publication Year: 1970, Page(s):501 - 503
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The choice of M equiprobable equipowered narrow-band waveforms of equal duration for the noncoherent communication system is considered. With the bandwidth constrained, the problem of finding optimal signal sets of given dimension is formulated as a variational one. For dimensionality D \leq 2M - K , View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On finite-memory recursive filters (Corresp.)

    Publication Year: 1970, Page(s):486 - 487
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    It has not been noted in the literature that finite-memory least-squares, recursive filters are unstable, and hence unsuited for a large number of recursions. This correspondence modifies the finite-memory least-squares recursive filters to allow for stable solutions. View full abstract»

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

    Publication Year: 1970, Page(s):432 - 438
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    The performance of a class of block codes with unbounded synchronization delay, though finite average synchronization delay, is analyzed. Basically the synchronizer inspects the code symbol stream for the first occurrence of one of a set of sequences that appear in only one timing position relative to true sync. The receiver can be implemented easily with shift registers and associated logic. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic norms and bounds of the arithmetic AN codes

    Publication Year: 1970, Page(s):470 - 476
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Properties of integers, related to the generation of the arithmetic AN codes, are investigated in this paper. A programmable algorithm for the computation of the binary norm of an arbitrary integer is developed. A table of norms of the natural numbers is generated and from this the distribution of integers of a given norm is found. These results are used to compute bounds on the size of an View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steady-state error in adaptive mean-square minimization

    Publication Year: 1970, Page(s):382 - 385
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    This paper considers the steady-state mean-square error when an adaptive linear estimator is used on a stationary time series. The estimator weights are adjusted periodically by moving a small increment in the direction of the estimated gradient. Under very general conditions the asymptotic mean-square error is bounded and under more restrictive conditions is evaluated exactly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth requirements for Walsh functions (Corresp.)

    Publication Year: 1970, Page(s):491 - 493
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The power-density spectrum for the Walsh function of binary order k is calculated. The model analyzed considers the Walsh function as a random sequence modulating a k th-order Rademacher function. The total number of Walsh functions of binary order k and less is found to be about View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified figure of merit for feature selection in pattern recognition (Corresp.)

    Publication Year: 1970, Page(s):504 - 507
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A modification of the conventional mutual-information figure of merit for feature selection in pattern recognition is described. A weighting function is combined with the mutual-information function that results in greater recognition accuracy for a linear classifier. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information rates of autoregressive processes

    Publication Year: 1970, Page(s):412 - 421
    Cited by:  Papers (69)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    The rate distortion function R(D) is calculated for two time-discrete autoregressive sources--the time-discrete Gaussian autoregressive source with a mean-square-error fidelity criterion and the binary-symmetric first-order Markov source with an average probability-of-error per bit fidelity criterion. In both cases it is shown that View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the amplitude of a sinusoid from noisy random samples (Corresp.)

    Publication Year: 1970, Page(s):487 - 489
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    The problem of estimating the amplitude of a sinusoid from noisy random samples is examined. The maximum-likelihood procedure, applied in the strong-signal case, yields a simple (albeit nonlinear) estimate. The mean-squared estimation error is obtained as a function of the sample size as well as the signal-to-noise ratio. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-memory hypothesis testing--A critique (Corresp.)

    Publication Year: 1970, Page(s):494 - 496
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    In this correspondence, we critically examine some recent papers that attempt to obtain optimal finite-memory solutions for some hypothesis-testing problems. We point out that these solutions contain hidden memory-consuming elements, and hence are not optimal. We present and examine various possible definitions of finite memory from a finite-state-machine viewpoint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recoverability of signals transmitted over a channel with interference due to independent samples of the input (Corresp.)

    Publication Year: 1970, Page(s):503 - 504
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    Consider a channel modeled as a linear operator with additive noise that arises from independent samples of the input. Sufficient conditions are presented for the existence of an m -dimensional input signal that can be recovered by means of a linear operator on the channel output. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-memory hypothesis testing--Comments on a critique (Corresp.)

    Publication Year: 1970, Page(s):496 - 497
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 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 note on the finite Walsh transform (Corresp.)

    Publication Year: 1970, Page(s):489 - 491
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    The theory of the finite Walsh transform is presented as a background to current interest in the fast Walsh transform algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on a partition for a decision feedback strategy (Corresp.)

    Publication Year: 1970, Page(s):493 - 494
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    A partition of the channel output space, which has the property that no other partition yields both a smaller probability of erasure and a smaller probability of error, is obtained and compared with a previous result due to Forney. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Factorization of spectra by discrete Fourier transforms (Corresp.)

    Publication Year: 1970, Page(s):484 - 485
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    A discrete Fourier transform method for factoring arbitrary spectral density functions is presented. The factorization can be implemented in a straightforward and efficient manner, and it does not require that the spectra be rational. An expression for the absolute error is also presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of decoders for convolutional codes by stochastic sequential machine methods

    Publication Year: 1970, Page(s):460 - 469
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1416 KB)

    In this paper, the decoder of a convolutional code is modeled as an autonomous stochastic sequential machine and finite Markov chain theory applied to obtain a precise expression for P_{FD} (u) , the probability of error associated with the feedback decoding of the u th subblock of information digits. The analysis techni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A theorem on conditional expectation

    Publication Year: 1970, Page(s):379 - 381
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    A statistic often encountered in various estimation problems is the conditional ensemble average of the time derivative of a random signal given the signal. It turns out that for a very large class of random signals this statistic is equal to zero. This is a rather surprising result and as far as can be determined has not been precisely stated and rigorously proven. A precise statement and a rigor... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering