# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 24 of 24
• ### Arthur Kohlenberg 1924-1970 (Obituary)

Publication Year: 1971, Page(s): 126
| PDF (81 KB)
• ### Rate distortion functions for finite-state finite-alphabet Markov sources

Publication Year: 1971, Page(s):127 - 134
Cited by:  Papers (39)
| | PDF (1120 KB)

A lower bound to the rate-distortion function<tex>R(D)</tex>of finite-alphabet sources with memory is derived for the class of balanced distortion measures. For finite-state finite-alphabet Markov sources, sufficient conditions are given for the existence of a strictly positive average distortion<tex>D_c</tex>such that<tex>R(D)</tex>equals its lower bound for<... View full abstract»

• ### Lower bounds in the capacity of permutation channels

Publication Year: 1971, Page(s):134 - 140
Cited by:  Papers (1)
| | PDF (900 KB)

In this paper, permutation channels, which include the rank channels and doubly uniform channels, are defined. A lower bound on the capacities of these channels is obtained with help of nonparametric signal-detection theory. This bound reduces to the actual capacity for memoryless doubly uniform channels by properly selecting the associated nonparametric detectors, The lower bounds on the capaciti... View full abstract»

• ### On the mutual information of memoryless channels

Publication Year: 1971, Page(s):140 - 143
Cited by:  Papers (3)
| | PDF (500 KB)

Let<tex>x_1, \cdots ,x_n</tex>and<tex>y_1, \cdots, y_n</tex>be input and output sequences of a channel. In the case of memoryless input sources, the following inequality on mutual information is well known: $$I((x_1, \cdots ,x_n),(y_1, \cdots ,y_n)) \geq \sum I(x_i, y_i).$$ It is straightforward to show that the inequality sign is reversed if the... View full abstract»

• ### Spectral representation of a periodic nonstationary random process

Publication Year: 1971, Page(s):143 - 149
Cited by:  Papers (56)
| | PDF (886 KB)

This paper deals with the periodic nonstationary process, the mean value and the correlation function of which are invariant under shift by a multiple of a certain period. The spectral representation is derived by making use of Loève's harmonizability theorem on a second-order nonstationary process. The process is represented as a sum of infinite stationary processes among which covariances exist.... View full abstract»

• ### Complex Gaussian noise moments

Publication Year: 1971, Page(s):149 - 157
Cited by:  Papers (31)
| | PDF (1176 KB)

The problem of the computation of moments of nonzero mean circularly complex Gaussian noise is treated. The noise need not be symmetric about the carrier frequency. In particular, the second-order moments are computed, and expansions are given. The necessary univariate and bivariate complex Hermite polynomials are discussed. The means of some rational functions useful in FM theory are given. This ... View full abstract»

• ### How does a porcupine separate its quills?

Publication Year: 1971, Page(s):157 - 161
Cited by:  Papers (8)
| | PDF (848 KB)

Sets of unit vectors in<tex>N</tex>-dimensional Euclidean vector space whose constituent vectors are separated one from another by at least a fixed distance<tex>d</tex>, prescribed once for all and independent of<tex>N</tex>, are of interest in theory and practice; they have fondly been called "porcupine codes." Although an elegant constructive proof of Gilbert ... View full abstract»

• ### Lower bounds on reliability functions of variable-length nonsystematic convolutional codes for channels with noiseless feedback

Publication Year: 1971, Page(s):161 - 171
Cited by:  Papers (12)
| | PDF (1675 KB)

A variable-length, nonsystematic, convolutional encoding, and successive-decoding scheme is devised to establish significant improvements in the reliability functions of memoryless channels with noiseless decision feedback. It is shown that, for any but pathological discrete memoryless channels with noiseless feedback, there exists a variable-length convolutional code such that the reliability fun... View full abstract»

• ### 'Diffuse' threshold decodable rate 1/2 convolutional codes

Publication Year: 1971, Page(s):171 - 180
Cited by:  Papers (3)
| | PDF (1146 KB)

This paper shows the existence (by construction) of rate<tex>\frac{1}{2}</tex>convolutional codes that correct bursts of length<tex>B</tex>or<tex>t</tex>random errors. The codes have memory length and guard space requirements that are asymptotically<tex>4B</tex>and minimal effective length. Kohlenberg introduced the term "diffuse code" for his two ra... View full abstract»

• ### Bibliography on data compression, picture properties, and picture coding

Publication Year: 1971, Page(s):180 - 197
Cited by:  Papers (9)
| | PDF (2930 KB)

Published papers and reports dealing with data compression, picture properties and models, picture coding and transmission, image enhancement, and human visual information processing are listed. View full abstract»

• ### Bibliography on rate distortion theory (Corresp.)

Publication Year: 1971, Page(s):198 - 199
Cited by:  Papers (3)
| | PDF (340 KB)

This bibliography contains articles and books on the subject of rate distortion theory. Growing interest in the subject is evident by the large number of recent publications. View full abstract»

• ### Variances of spectral parameters with a Gaussian shape (Corresp.)

Publication Year: 1971, Page(s):200 - 201
Cited by:  Papers (6)
| | PDF (146 KB)

In the paper [1] by the late M. J. Levin, maximum likelihood estimates and limits on their variances are derived for the parameters of the power spectrum of a zero-mean stationary Gaussian process. In this note we rederive the variances of these estimates in a somewhat different manner and give numerical results for power spectra with a Gaussian shape. View full abstract»

• ### Detection based on uncertain error cost: A minimax approach (Corresp.)

Publication Year: 1971, Page(s):202 - 203
| | PDF (341 KB)

A game model is introduced for statistical signal detection, where error costs are too uncertain for a Bayes decision rule. The minimax decision strategy is mixed. It is shown that the optimum decision probabilities are equal to the a posteriori probabilities of the alternatives. View full abstract»

• ### An upper bound for probability of error related to a given decision region in N-dimensional signal set (Corresp.)

Publication Year: 1971, Page(s):203 - 206
Cited by:  Papers (6)
| | PDF (557 KB)

An upper bound for the probability of error related to a given decision region, in an arbitrary<tex>N</tex>-dimensional signal set transmitted over a coherent Gaussian white noise channel, is described here. This bound is valid for any number of dimensions and for any closed decision region that satisfies a very weak condition. View full abstract»

• ### Estimation of randomly occurring stochastic signals in Gaussian noise (Corresp.)

Publication Year: 1971, Page(s): 206
Cited by:  Papers (3)
| | PDF (120 KB)

This note applies the general likelihood ratio for the minimum-mean-square-error estimation of the signal when the presence of the signal at the receiver is uncertain during the entire observation interval. View full abstract»

• ### Realization of the Gauss-in-Gauss detector using minimum-mean-squared-error filters (Corresp.)

Publication Year: 1971, Page(s):207 - 209
Cited by:  Papers (2)
| | PDF (398 KB)

Alternative structures for the optimum detection of Gaussian signals in Gaussian noise are derived that can be interpreted in terms of minimum-mean-squared-error (MMSE) estimators of signal and noise. The realization is useful when the statistics of the signal or noise or both are unknown since the detector can be implemented in an adaptive mode by using tapped delay lines whose weights are adjust... View full abstract»

• ### Worst interference for coherent binary channel (Corresp.)

Publication Year: 1971, Page(s):209 - 210
Cited by:  Papers (10)
| | PDF (338 KB)

For a coherent channel transmitting binary digits, a worst distribution under an average power constraint can be defined. A solution for the very noisy channel is found to be Gaussian, and the minimax demodulator utilizes correlation detection to guarantee an exponential bound on probability of error. View full abstract»

• ### Comments on "Note on a partition for a decision feedback strategy" by Lavenberg, S.S.

Publication Year: 1971, Page(s):210 - 211
| PDF (309 KB)
• ### On the number of points in regular discrete simplex (Corresp.)

Publication Year: 1971, Page(s):211 - 212
| PDF (293 KB)
• ### Strengthened lower bound on definite decoding minimum distance for periodic convolutional codes (Corresp.)

Publication Year: 1971, Page(s):212 - 214
Cited by:  Papers (1)
| | PDF (463 KB)

A new lower bound on definite decoding minimum distance for the class of systematic binary periodic convolutional codes is presented. The bound is everywhere stronger than Wagner's bound and has the same form as the bound obtained by Massey for the class of systematic binary fixed convolutional codes. The bound is also shown to apply to a specific subclass of simply implemented periodic codes for ... View full abstract»

• ### Cyclic codes with unequal error protection (Corresp.)

Publication Year: 1971, Page(s):214 - 215
Cited by:  Papers (23)
| | PDF (294 KB)

This paper shows that, although systematic cyclic codes have equal error protection for all information digits, there exist non-systematic cyclic codes that can provide unequal error protection for the information digits; that is, at least one information digit is protected for a number of errors that is larger than the number guaranteed by the minimum distance of the code. View full abstract»

• ### Graph theoretic<tex>q</tex>-ary codes (Corresp.)

Publication Year: 1971, Page(s):215 - 218
Cited by:  Papers (5)
| | PDF (756 KB)

This correspondence formulates<tex>GF(q)</tex>matrix descriptions for a class of weighted, directed graphs. As a result of this formulation, the concept of graph theoretic error-correcting codes is generalized to the<tex>q</tex>-ary case. It is shown that graph theoretic<tex>q</tex>-ary codes are completely orthogonalizable and, hence, one-step majority decodabl... View full abstract»

• ### Decoding augmented cutset codes (Corresp.)

Publication Year: 1971, Page(s):218 - 220
Cited by:  Papers (2)
| | PDF (472 KB)

Cutset codes augmented by Hakimi and Frank's technique are shown to be two-step orthogonalizable and, hence, two-step majority decodable. It is seen that these codes can also be decoded by decoders that have virtually the same amount of hardware as completely orthogonalizable codes with the same dimension. View full abstract»

• ### In Galois Fields (Corresp.)

Publication Year: 1971, Page(s): 220
| PDF (133 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