# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 26
• ### Information rates of Wiener processes

Publication Year: 1970, Page(s):134 - 139
Cited by:  Papers (39)
| | PDF (786 KB)

Rate distortion functions are calculated for time discrete and time continuous Wiener processes with respect to the mean squared error criterion. In the time discrete case, we find the interesting result that, for0 \leq D \leq \sigma^2 /4,R(D)for the Wiener process is identical toR(D)for the sequence of zero mean independent normally distributed increments of varia... View full abstract»

• ### On the representation of continuous parameter processes by a sequence of random variables

Publication Year: 1970, Page(s):139 - 141
Cited by:  Papers (8)
| | PDF (435 KB)

This paper examines the question of representing a continuous parameter random process<tex>\{ x_t, t \in T \}</tex>by a sequence of random variables "without loss of information." The principal result is that such a representation by expansion coefficients relative to a basis<tex>\{ \phi_i \}</tex>of<tex>\mathcal{L}_2(T)</tex>is always possible, regardless of th... View full abstract»

• ### On the representation of a continuous stochastic intensity by Poisson shot noise

Publication Year: 1970, Page(s):142 - 147
Cited by:  Papers (4)
| | PDF (954 KB)

In many applications a Poisson shot noise (PSN) process is said to statistically "represent" its intensity process. In this paper an investigation is made of the relationship between a PSN process and its intensity, when the latter is a sample function of a continuous stochastic process. The difference of the moments and the mean-square difference between the two processes are examined. The contin... View full abstract»

• ### Alias-free randomly timed sampling of stochastic processes

Publication Year: 1970, Page(s):147 - 152
Cited by:  Papers (66)  |  Patents (1)
| | PDF (1058 KB)

The notion of alias-free sampling is generalized to apply to random processes<tex>x(t)</tex>sampled at random times<tex>t_n</tex>; sampling is said to be alias free relative to a family of spectra if any spectrum of the family can be recovered by a linear operation on the correlation sequence<tex>\{r(n)\}</tex>, where<tex>r(n) = E[x(l_{m+n}) \overline{x(t_... View full abstract»

• ### Nonlinear estimation with quantized measurements--PCM, predictive quantization, and data compression

Publication Year: 1970, Page(s):152 - 161
Cited by:  Papers (31)
| | PDF (1334 KB)

Statistics conditioned on quantized measurements are considered in the general case. These results are specialized to Gaussian parameters and then extended to discrete-time linear systems. The conditional mean of the system's state vector may be found by passing the conditional mean of the measurement history through the Kalman filter that would be used had the measurements been linear. Repetitive... View full abstract»

• ### Identification of a transition matrix of a Markov chain from noisy measurements of state

Publication Year: 1970, Page(s):161 - 166
Cited by:  Papers (5)
| | PDF (709 KB)

We consider the problem of recursively estimating the transition matrix of a regular Markov chain with a finite number of states using only noisy measurements of the state. The measurement noise sequence is assumed to be independent with known mean and unknown variance. We also discuss the convergence rates and computational aspects of the algorithms and the methods of accelerating them. View full abstract»

• ### Probing linear filters-- Signal design for the detection problem

Publication Year: 1970, Page(s):167 - 171
Cited by:  Papers (11)
| | PDF (711 KB)

The problem of designing an optimum probing signal for discriminating between two known linear filters in the presence of noise is considered. It is shown that in the general case of colored noise, the optimum signal is the solution of two simultaneous integral equations. An expression for the probability of error is given, and some illustrative examples are presented. View full abstract»

• ### Bounds on performance of optimum quantizers

Publication Year: 1970, Page(s):172 - 184
Cited by:  Papers (19)
| | PDF (1620 KB)

A quantizer<tex>Q</tex>divides the range [0, 1] of a random variable<tex>x</tex>into<tex>K</tex>quantizing intervals the<tex>i</tex>th such interval having length<tex>\Delta x_i</tex>. We define the quantization error for a particular value of<tex>x</tex>(unusually) as the length of the quantizing interval in which<tex>x... View full abstract»

• ### The two-armed-bandit problem with time-invariant finite memory

Publication Year: 1970, Page(s):185 - 195
Cited by:  Papers (49)
| | PDF (1669 KB)

This paper solves the classical two-armed-bandit problem under the finite-memory constraint described below. Given are probability densities<tex>p_0</tex>and<tex>p_1</tex>, and two experiments<tex>A</tex>and<tex>B</tex>. It is not known which density is associated with which experiment. Thus the experimental outcome<tex>Y</tex>of experime... View full abstract»

• ### Signals that can be calculated from their ambiguity function

Publication Year: 1970, Page(s):195 - 202
Cited by:  Papers (6)
| | PDF (1057 KB)

A new lemma relates the analytic extensions of two time functions<tex>u(t)</tex>and<tex>v(t)</tex>to the Laplace transform of their ambiguity function<tex>\psi_{uv}</tex>. This lemma is used to derive necessary conditions for<tex>u</tex>and<tex>v</tex>from two bounds on the behavior of<tex>\psi_{uv}</tex>, at infinity. In part... View full abstract»

• ### Geometry of optimum incoherent detection

Publication Year: 1970, Page(s):202 - 205
Cited by:  Papers (2)
| | PDF (702 KB)

The problem of distinguishing between two narrow-band signals in the presence of additive Gaussian noise when the forms of both signals are known except for phase is basically four dimensional, as the lack of phase information turns signal vectors into signal circles. The geometry of signal vectors and of the planes of signal circles is shown to account for the optimality of matched-filter detecti... View full abstract»

• ### Signal design for efficient detection in dispersive channels

Publication Year: 1970, Page(s):206 - 213
Cited by:  Papers (7)
| | PDF (1187 KB)

Signal design for maximizing the efficiency of the Neyman-Pearson detection procedure in randomly dispersive media is investigated. The medium is modeled as a randomly time-varying linear filter; by viewing the filter transfer function as a homogeneous random field on the time-frequency plane, a second-order theory results that relates various second-order measures of the time and frequency struct... View full abstract»

• ### Flicker effect and television compression

Publication Year: 1970, Page(s):214 - 218
Cited by:  Papers (4)
| | PDF (975 KB)

The perception of flicker by the human eye depends upon the picture content, and this paper describes a relation between the critical flicker frequency<tex>f_c</tex>and the spatial frequency<tex>f_x</tex>. Provided that the visual picture is presented in such a way that each spatial component, presented at a frequency<tex>f_p</tex>, obeys the inequality<tex&g... View full abstract»

• ### Error probability bounds for systematic convolutional codes

Publication Year: 1970, Page(s):219 - 224
Cited by:  Papers (11)
| | PDF (920 KB)

Upper and lower bounds on error probability for systematic convolutional codes are obtained. These bounds show that the probability of error for a systematic convolutional code is larger than the probability of error for a nonsystematic convolutional code of the same encoder-shift-register length. Two different interpretations of these results are given. View full abstract»

• ### A note on filtering for independent increment processes (Corresp.)

Publication Year: 1970, Page(s):224 - 226
Cited by:  Papers (2)
| | PDF (468 KB)

Using the equations of Fisher and Stear, a suboptimal filter for estimating the state of a linear system subject to non-Gaussian noise is developed. Some qualitative properties of this filter are derived. View full abstract»

• ### Fitting continuous probability density functions over [0,<tex>infty</tex>) using information theory ideas (Corresp.)

Publication Year: 1970, Page(s):226 - 230
Cited by:  Papers (27)
| | PDF (717 KB)

The problem of estimating a probability density function<tex>p(x)</tex>over<tex>[0, \infty)</tex>when several low-order moments are known is considered. A computational procedure, based on information theory, is used to obtain the maximum entropy estimates of<tex>p(x)</tex>in a number of cases. The situation when the first two moments only are known is considere... View full abstract»

• ### Comments on the Estimation of Distribution Functions [Corresp.]

Publication Year: 1970, Page(s): 226
| PDF (139 KB)
• ### The inversion of covariance matrices by finite Fourier transforms (Corresp.)

Publication Year: 1970, Page(s):230 - 232
Cited by:  Papers (16)
| | PDF (387 KB)

A matrix series is derived that converges to the inverse of a covariance matrix. The members of the series are derived from a circular matrix that can be inverted by taking finite Fourier transforms. An example of the method is presented. View full abstract»

• ### An integral relevant to the detection of a signal in polarized Gaussian noise (Corresp.)

Publication Year: 1970, Page(s): 232
Cited by:  Papers (1)
| | PDF (125 KB)

An integral is calculated that arises while determining the probability of detecting a signal in polarized Gaussian noise and the probability of hitting a particular elliptical target with an imperfect weapon. View full abstract»

• ### Calculation of Fourier transforms on finite Abelian groups (Corresp.)

Publication Year: 1970, Page(s):233 - 234
Cited by:  Papers (15)
| | PDF (329 KB)

A recent paper by Crimmins et al. deals with minimization of mean-square error for group codes by the use of Fourier transforms on groups. In this correspondence a method for representing the groups in a form suitable for machine calculation is shown. An efficient method for calculating the Fourier transform of a group is also proposed and its relationship to the fast Fourier transform is shown. F... View full abstract»

• ### A few useful details about a known technique for factoring 1 +X^{2q-1} (Corresp.)

Publication Year: 1970, Page(s):234 - 235
Cited by:  Papers (2)
| PDF (298 KB)
• ### Nonbinary random error-correcting codes (Corresp.)

Publication Year: 1970, Page(s):236 - 237
Cited by:  Papers (2)
| | PDF (224 KB)

Primitive BCH codes with symbols from<tex>GF(q)</tex>and designed distance<tex>d</tex>have parameter values \begin{align} \text{block length} &amp;= n = q^m - 1 \\ \text{check symbols/block} &amp;= r \leq m(d - 1) \end{align} where<tex>m</tex>is any positive integer. For many nonbinary BCH codes (called maximally redundant codes), the maximum number of c... View full abstract»

• ### Some difference triangles for constructing self-orthogonal codes (Corresp.)

Publication Year: 1970, Page(s):237 - 238
Cited by:  Papers (7)
| PDF (263 KB)
• ### Further results on the synchronization of binary cyclic codes (Corresp.)

Publication Year: 1970, Page(s):238 - 241
Cited by:  Papers (6)  |  Patents (2)
| | PDF (544 KB)

It is shown that certain coset codes derived from binary cyclic codes can determine the magnitude of a synchronization error, as well as its direction by examining only the syndrome of the received<tex>n</tex>tuple. For such coset codes, therefore, the need for a search procedure to recover synchronism is eliminated. In addition, the range of slip that can be detected and corrected for... View full abstract»

• ### Synchronizable error-correcting binary codes (Corresp.)

Publication Year: 1970, Page(s):241 - 242
Cited by:  Papers (1)  |  Patents (1)
| PDF (367 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