By Topic

Information Theory, IEEE Transactions on

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
    Save to Project icon | Request Permissions | 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
    Save to Project icon | Request Permissions | 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
    Save to Project icon | Request Permissions | PDF file iconPDF (170 KB)  
    Freely Available from IEEE
  • Probability of error, equivocation, and the Chernoff bound

    Publication Year: 1970 , Page(s): 368 - 372
    Cited by:  Papers (85)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (528 KB)  

    Relationships between the probability of error, the equivocation, and the Chernoff bound are examined for the two-hypothesis decision problem. The effect of rejections on these bounds is derived. Finally, the results are extended to the case of any finite number of hypotheses. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bootstrapping the generalized least-squares estimator in colored Gaussian noise with unknown covariance parameters

    Publication Year: 1970 , Page(s): 385 - 392
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1136 KB)  

    It is demonstrated that in problems involving the estimation of linear regression parameters in colored Gaussian noise, the simple least-squares estimator can be significantly suboptimal. When the noise covariance function can be described as a known function of a finite number of unknown nonrandom parameters, it is possible to take advantage of this information to improve upon the least-squares e... 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)
    Save to Project icon | Request Permissions | 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.
  • Information channel capacity of a photographic film (Corresp.)

    Publication Year: 1970 , Page(s): 477 - 480
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | 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.
  • Circulant bases for cyclic codes (Corresp.)

    Publication Year: 1970 , Page(s): 511 - 512
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (360 KB)  

    It is shown that there exists a large class of cyclic codes for which there are circulant bases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reexamination of the prefiltering problem in a state-variable formulation (Corresp.)

    Publication Year: 1970 , Page(s): 480 - 484
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (712 KB)  

    Optimal (least-mean-square linear) filtering of random signals prior to sampling may be represented as a Wiener-Kalman state-variable filter followed by a coder that synthesizes the signal to be sampled as a linear combination of the estimated states. Although the prefilter doubles the number of states of the overall presampling signal process, the postsampling reconstruction filter need only mode... View full abstract»

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

    Publication Year: 1970 , Page(s): 393 - 396
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (536 KB)  

    A general likelihood ratio formula of the author's for the detection of signals in independent white Gaussian noise is extended to allow a "one-sided" dependence in which only the future white noise is required to be independent of past signal and noise. The assumption of Gaussian additive noise is also somewhat relaxed. The proof is based on some recent martingale theorems and on the concept of t... 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)
    Save to Project icon | Request Permissions | 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.
  • Transmission of noisy information to a noisy receiver with minimum distortion

    Publication Year: 1970 , Page(s): 406 - 411
    Cited by:  Papers (68)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (824 KB)  

    This paper is concerned with the transmission of information with a fidelity criterion where the source output may be distorted prior to encoding and, furthermore, where the output of the decoder may be distorted prior to its delivery to the final destination. The criterion for optimality is that the normalized average of the squared norm of the difference between the 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
    Save to Project icon | Request Permissions | 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 the detection of a sudden change in system parameters

    Publication Year: 1970 , Page(s): 497 - 500
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | 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.
  • Intersymbol interference on a continuous-time Gaussian channel

    Publication Year: 1970 , Page(s): 422 - 429
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1136 KB)  

    The effect on the probability of error from intersymbol interference caused by a repeated use of a continuous-time Gaussian channel is examined. The model assumes that signals that are power constrained are put through a linear filter after which Gaussian noise is added to produce the received signal. One can view the linear filter as a frequency constraint on the inputs. Because of the memory in ... 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)
    Save to Project icon | Request Permissions | 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.
  • Factorization of spectra by discrete Fourier transforms (Corresp.)

    Publication Year: 1970 , Page(s): 484 - 485
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | 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.
  • Further results on product codes

    Publication Year: 1970 , Page(s): 446 - 451
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (984 KB)  

    A new class of codes, called product generator codes, which are similar to Elias's iterated codes, are investigated. An important subclass of these codes is the generalized Reed-Muller codes. If the original codes that are iterated to produce a product code are L_1 and L_2 -step orthogonalizable, then the product code is (... 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)
    Save to Project icon | Request Permissions | 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.
  • Further results on cyclic product codes

    Publication Year: 1970 , Page(s): 452 - 459
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | 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.
  • Information rates of autoregressive processes

    Publication Year: 1970 , Page(s): 412 - 421
    Cited by:  Papers (66)
    Save to Project icon | Request Permissions | 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.
  • Another recursive method of computing the Q function (Corresp.)

    Publication Year: 1970 , Page(s): 500 - 501
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | 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.
  • Bandwidth requirements for Walsh functions (Corresp.)

    Publication Year: 1970 , Page(s): 491 - 493
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | 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.
  • Finite-memory hypothesis testing--A critique (Corresp.)

    Publication Year: 1970 , Page(s): 494 - 496
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | 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.
  • Application of state-variable techniques to optimal feature extraction--- Multichannel analog data

    Publication Year: 1970 , Page(s): 396 - 406
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1504 KB)  

    In problems of pattern recognition and signal detection, one of the most important tasks is that of finding practical ways of preprocessing the data to eliminate complexity, redundancy, and irrelevancy. In this paper it is assumed that a vector wavefonn is received during an interval [t_o, t_f] . The waveform is considered to be a sample of a nonstationary ve... 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