# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 28
• ### Information theory in the sixties

Publication Year: 1973, Page(s):257 - 262
Cited by:  Papers (10)  |  Patents (3)
| | PDF (1159 KB)

This retrospective survey describes the major trends in information theory research during the decade of the sixties, with emphasis on channel and source coding. View full abstract»

• ### Recent progress in stochastic processes--A survey

Publication Year: 1973, Page(s):262 - 275
Cited by:  Papers (29)
| | PDF (2439 KB)

This paper surveys some of the literature on applications of stochastic processes published during the period 1968-1972. This survey highlights recent developments in the application of martingale theory. Because this subject is relatively new to the engineering community, a tutorial exposition of some aspects of the martingale calculus is also included. View full abstract»

• ### On functionals satisfying a data-processing theorem

Publication Year: 1973, Page(s):275 - 283
Cited by:  Papers (39)
| | PDF (1252 KB)

It is shown that the rate-distortion bound<tex>(R(d) \leq C)</tex>remains true when<tex>-\log x</tex>in the definition of mutual information is replaced by an arbitrary concave<tex>(\cup)</tex>nonincreasing function satisfying some technical conditions. Examples are given showing that for certain choices of the concave functions, the bounds obtained are better t... View full abstract»

• ### Information rates for Poisson sequences

Publication Year: 1973, Page(s):283 - 294
Cited by:  Papers (8)
| | PDF (1688 KB)

The rate-distortion function of a Poisson sequence, under a single-letter magnitude-error distortion measure is derived and studied. Simple approximations to the rate-distortion curve for low and high distortions are obtained. A useful lower bound to this curve is derived and an upper bound is generated by a simple instrumentable coding scheme. The rate-distortion relationship for the latter is se... View full abstract»

• ### Level-crossing problems for random processes

Publication Year: 1973, Page(s):295 - 315
Cited by:  Papers (203)
| | PDF (2561 KB)

In a variety of practical problems involving random processes, it is necessary to have statistical information on their level-crossing properties. This paper presents a survey of known results on certain aspects of this problem and provides a basis for further study in the area. The goal has been to give a broad view of the problems considered in the literature and a brief indication of the techni... View full abstract»

• ### Testing for harmonizability

Publication Year: 1973, Page(s):316 - 320
Cited by:  Papers (6)
| | PDF (694 KB)

Let<tex>R(s,t)</tex>be a covariance function having the representation $$R(s,t) = \int_{-\infty}^{\infty} \int_{-\infty}^{\infty} \exp (isx - ity)d^2 G(x,y)$$ where<tex>G(x,y)</tex>is continuous to the right in both variables and is of bounded variation in the plane; then<tex>R(s,t)</tex>is harmonizable in that<tex>G(x,y)</te... View full abstract»

• ### Optimization of k nearest neighbor density estimates

Publication Year: 1973, Page(s):320 - 326
Cited by:  Papers (94)
| | PDF (880 KB)

Nonparametric density estimation using the<tex>k</tex>-nearest-neighbor approach is discussed. By developing a relation between the volume and the coverage of a region, a functional form for the optimum<tex>k</tex>in terms of the sample size, the dimensionality of the observation space, and the underlying probability distribution is obtained. Within the class of density fun... View full abstract»

• ### Random geometric series and intersymbol interference

Publication Year: 1973, Page(s):326 - 335
Cited by:  Papers (43)
| | PDF (1468 KB)

An interesting and long-standing problem in probability theory is surveyed, and its applications to analyzing the effects of intersymbol interference in digital transmission systems are discussed. Old and new results are presented which enable one to obtain analytical forms for the probability density function of the intersymbol interference in special eases. The probability of error is then compu... View full abstract»

• ### Correction of errors in multilevel Gray coded data

Publication Year: 1973, Page(s):336 - 340
Cited by:  Papers (8)  |  Patents (3)
| | PDF (766 KB)

In this paper we present a new error-control technique intended for use in<tex>2^l</tex>-level data-transmission systems that employ Gray coding to transform a binary source sequence into the<tex>2^l</tex>-ary transmitted sequence. The codes, which we call<tex>i</tex>-compressed codes, make use of the structure of binary codes and have the property that for some... View full abstract»

• ### Direct sequential encoding and decoding for discrete sources

Publication Year: 1973, Page(s):340 - 343
Cited by:  Papers (62)
| | PDF (504 KB)

The method of sequential encoding and decoding is generalized to the case of a source with redundancy. A computational entropy of the source analogous to the computational cutoff rate of the channel is introduced. A range of transmission rates is found for which the average number of decoding computations is finite. View full abstract»

• ### Minimum-distance bounds for binary linear codes

Publication Year: 1973, Page(s):344 - 356
Cited by:  Papers (65)  |  Patents (1)
| | PDF (1339 KB)

This paper presents a table of upper and lower bounds on<tex>d_{max} (n,k)</tex>, the maximum minimum distance over all binary, linear<tex>(n,k)</tex>error-correcting codes. The table is obtained by combining the best of the existing bounds on<tex>d_{max} (n,k)</tex>with the minimum distances of known codes and a variety of code-construction techniques. View full abstract»

• ### On the converse to the coding theorem for discrete memoryless channels (Corresp.)

Publication Year: 1973, Page(s):357 - 359
Cited by:  Papers (107)
| | PDF (390 KB)

A new lower bound on the probability of decoding error for the case of rates above capacity is presented. It forms a natural companion to Gallager's random coding bound for rates below capacity. The strong converse to the coding theorem follows immediately from the proposed lower bound. View full abstract»

• ### Bounds on the<tex>epsilon</tex>-entropy of Wiener and<tex>RC</tex>processes (Corresp.)

Publication Year: 1973, Page(s):359 - 362
Cited by:  Papers (2)
| | PDF (355 KB)

Upper and lower bounds on the<tex>\varepsilon</tex>-entropy of the Wiener process and the<tex>RC</tex>process are derived. The bounds are quite tight for small<tex>\varepsilon</tex>. The associated rate-distortion function is discussed and upper and lower bounds on this function are derived. View full abstract»

• ### Locally best unbiased estimation of the correlation coefficient in a bivariate normal population (Corresp.)

Publication Year: 1973, Page(s):363 - 364
| PDF (247 KB)
• ### On the reconstruction error of sampled data estimates (Corresp.)

Publication Year: 1973, Page(s):365 - 367
Cited by:  Papers (5)
| | PDF (409 KB)

In the sampling and reconstruction of a random process a discrepancy may occur between its multiplicity and that of its reconstructed version. It is shown that under general conditions an error due to this discrepancy is not present in the total error due to sampling and reconstruction. The problem is studied in the more general framework of tracking a random process of arbitrary multiplicity with... View full abstract»

• ### Correction to 'Performance of M-ary PSK Systems in Gaussian Noise and Intersymbol Interference'

Publication Year: 1973, Page(s): 365
Cited by:  Papers (2)
| PDF (117 KB)
• ### An application of the minimum discrimination information estimate for detecting Gaussian signals (Corresp.)

Publication Year: 1973, Page(s):367 - 369
Cited by:  Papers (1)
| | PDF (376 KB)

The minimum discrimination information estimate is used to compute the log-likelihood ratio, or logarithm of the Radon-Nikodym derivative, when the Gaussian signal has one of two covariance functions. View full abstract»

• ### Consistency of an estimate of tree-dependent probability distributions (Corresp.)

Publication Year: 1973, Page(s):369 - 371
Cited by:  Papers (17)
| | PDF (438 KB)

We demonstrate in this correspondence that the procedure introduced by Chow and Liu for estimating tree-dependent probability distributions is consistent. View full abstract»

• ### Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)

Publication Year: 1973, Page(s):371 - 372
Cited by:  Papers (92)  |  Patents (13)
| | PDF (239 KB)

This paper gives a tabulation of binary convolutional codes with maximum free distance for rates<tex>\frac{1}{2}, \frac{1}{3}</tex>, and<tex>\frac{1}{4}</tex>for all constraint lengths (measured in information digits)<tex>\nu</tex>up to and including<tex>nu = 14</tex>. These codes should be of practical interest in connection with Viterbi decoders. View full abstract»

• ### Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972)

Publication Year: 1973, Page(s): 373
| PDF (443 KB)
• ### Review of 'Estimation Theory With Applications to Communication and Control' (Sage, A. P., and Melsa, J. L.; 1971)

Publication Year: 1973, Page(s):374 - 375
| PDF (381 KB)
• ### Predictive source coding of correlated Gaussian processes (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 376
| PDF (165 KB)
• ### Representation and estimation of cyclostationary processes (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 376
| PDF (165 KB)
• ### Acoustic volume reverberation in the ocean: Theory, experiment, and simulation (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 376
| PDF (165 KB)
• ### Complete decoding of some binary BCH codes (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 377
| PDF (153 KB)

## 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