IEEE Transactions on Information Theory

Volume 16 Issue 4 • July 1970

Filter Results

Displaying Results 1 - 25 of 39
  • A theorem on conditional expectation

    Publication Year: 1970, Page(s):379 - 381
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 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.
  • Application of state-variable techniques to optimal feature extraction--- Multichannel analog data

    Publication Year: 1970, Page(s):396 - 406
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1489 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 vector random process containing... 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 (99)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (814 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 theT- second undistort... 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 (82)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1374 KB)

    The rate distortion functionR(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 thatR(D)is bounded below by the rate distortion fun... 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 (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (846 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.
  • Further results on product codes

    Publication Year: 1970, Page(s):446 - 451
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (974 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 areL_1andL_2-step orthogonalizable, then the product code is (L_1 + L_2 - 1)-step orthogonalizable. Further i... 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 (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 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.
  • Analysis of decoders for convolutional codes by stochastic sequential machine methods

    Publication Year: 1970, Page(s):460 - 469
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1406 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 forP_{FD} (u), the probability of error associated with the feedback decoding of theuth subblock of information digits. The analysis technique developed extends directly to any convolutional decoder ... 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 (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (701 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 ane 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 (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB)

    The power-density spectrum for the Walsh function of binary orderkis calculated. The model analyzed considers the Walsh function as a random sequence modulating akth-order Rademacher function. The total number of Walsh functions of binary orderkand less is found to be aboutfrac{1}{6}of the overbound 2.4TW. 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
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB)

    The choice ofMequiprobable 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 dimensionalityD leq 2M - K,K leq 2[M/3], where [ ] denotes "integer part of," andM geq 6 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 (302 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 anm-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.
  • Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.)

    Publication Year: 1970, Page(s):509 - 510
    Cited by:  Papers (1)
    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.
  • A new look at the Golay (23, 12) code (Corresp.)

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

    The (23, 12) binary Golay code is a member of a class of linear codes, obtained by extending nonlinear double-error-correcting codes recently discovered. While all other codes of the class have minimum distanced_m= 6, the (23, 12) code owes its unique property (d_m= 7) to the nonexistence of the BCH code of length 7 andd_m= 6. 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
  • Probability of error, equivocation, and the Chernoff bound

    Publication Year: 1970, Page(s):368 - 372
    Cited by:  Papers (155)  |  Patents (8)
    Request permission for commercial reuse | 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.
  • A modified figure of merit for feature selection in pattern recognition (Corresp.)

    Publication Year: 1970, Page(s):504 - 507
    Cited by:  Papers (3)
    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.
  • Learning with a probabilistic teacher

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

    The Bayesian learning scheme is computationally infeasible for most of the unsupervised learning problems. This paper suggests a learning scheme, "learning with a probabilistic teacher," which works with unclassified samples and is computationally feasible for many practical problems. In this scheme a sample is probabilistically assigned with a class with appropriate probabilities computed using a... 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.
  • On finite-memory recursive filters (Corresp.)

    Publication Year: 1970, Page(s):486 - 487
    Cited by:  Papers (5)
    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.
  • Circulant bases for cyclic codes (Corresp.)

    Publication Year: 1970, Page(s):511 - 512
    Cited by:  Papers (11)
    Request permission for commercial reuse | 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.
  • Intersymbol interference on a continuous-time Gaussian channel

    Publication Year: 1970, Page(s):422 - 429
    Cited by:  Papers (2)
    Request permission for commercial reuse | 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.
  • Steady-state error in adaptive mean-square minimization

    Publication Year: 1970, Page(s):382 - 385
    Cited by:  Papers (17)
    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.
  • A note on the performance of concatenated codes (Corresp.)

    Publication Year: 1970, Page(s):512 - 513
    Cited by:  Papers (4)
    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.

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