# IEEE Transactions on Information Theory

## Filter Results

Displaying Results 1 - 25 of 27
• ### A survey of the communication theory literature: 1968-1973

Publication Year: 1973, Page(s):725 - 739
Cited by:  Papers (49)
| | PDF (2919 KB)

This paper surveys the literature on communication theory from 1968 to 1973. A large part of this literature, and of this paper, deals with digital communication through linear dispersive channels. Error rate bounds for pulse-amplitude modulation systems, the optimization of linear transmitters and receivers, and adaptive equalization are topics discussed initially. Important results from the lite... View full abstract»

• ### Multiple-parameter quantum estimation and measurement of nonselfadjoint observables

Publication Year: 1973, Page(s):740 - 750
Cited by:  Papers (108)
| | PDF (1698 KB)

A quantum mechanical form of the Cramér-Rao inequality and a minimum-mcan-square-error quantum estimator for multiple parameters are derived, allowing all possible quantum measurements of the received field. The role of nonselfadjoint operators is emphasized in the formulation. Relations of our results to previous work on quantum estimation are discussed. For the estimation of complex mode amplitu... View full abstract»

• ### Some new algorithms for recursive estimation in constant linear systems

Publication Year: 1973, Page(s):750 - 760
Cited by:  Papers (129)
| | PDF (1267 KB)

Recursive least-squares estimates for processes that can be generated from finite-dimensional linear systems are usually obtained via an<tex>n \times n</tex>matrix Riccati differential equation, where<tex>n</tex>is the dimension of the state space. In general, this requires the solution of<tex>n(n + 1)/2</tex>simultaneous nonlinear differential equations. For co... View full abstract»

• ### Sufficient statistics and reproducing densities in simultaneous sequential detection and estimation

Publication Year: 1973, Page(s):760 - 768
Cited by:  Papers (25)
| | PDF (1392 KB)

The doubly-compound hypothesis detection problem with finite-dimensional parameter vectors is treated in a general context. It is shown that estimation and detection occur simultaneously, with the detector using the a posteriori densities generated by two separate estimators, one for each hypothesis. No assumptions are made on the estimation criterion and very loose assumptions on the detection cf... View full abstract»

• ### A theorem on the entropy of certain binary sequences and applications--I

Publication Year: 1973, Page(s):769 - 772
Cited by:  Papers (111)
| | PDF (467 KB)

In this, the first part of a two-part paper, we establish a theorem concerning the entropy of a certain sequence of binary random variables. In the sequel we will apply this result to the solution of three problems in multi-user communication, two of which have been open for some time. Specifically we show the following. LetXandYbe binary randomn-vectors, which are... View full abstract»

• ### A theorem on the entropy of certain binary sequences and applications--II

Publication Year: 1973, Page(s):772 - 777
Cited by:  Papers (32)
| | PDF (758 KB)

In this, the second part of a two-part paper, we apply the result of Part I [9] to three problems in multi-user communication. 1) For the special case of the broadcast channel where both channels are binary symmetric, we establish a converse result that shows the ad hoc scheme suggested by Cover and Bergmans [2], [3l is in fact optimal. 2) For a modified version of a source coding problem with sid... View full abstract»

• ### Two-step encoding for finite sources

Publication Year: 1973, Page(s):778 - 782
Cited by:  Papers (27)
| | PDF (673 KB)

Any finite information source is given a graph structure, in which two vertices are adjacent whenever the two corresponding source letters are distinguishable by the coder-decoder pair. Usual sources correspond, therefore, to complete graphs. If the associated graph is not complete, however, an<tex>\varepsilon</tex>-code for the source can be constructed in two steps: in the first, dis... View full abstract»

• ### Universal noiseless coding

Publication Year: 1973, Page(s):783 - 795
Cited by:  Papers (228)  |  Patents (4)
| | PDF (1996 KB)

Universal coding is any asymptotically optimum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is found that... View full abstract»

• ### Two-dimensional Fire codes

Publication Year: 1973, Page(s):796 - 806
Cited by:  Papers (32)  |  Patents (1)
| | PDF (1721 KB)

To improve the reliability of two-dimensional information, codes that can correct two-dimensional bursts (or spots) may be useful. In this paper a class of two-dimensional burst-correcting codes, called two-dimensional Fire codes, is proposed. The definition of these codes is a natural extension of that of the conventional Fire codes. The two-dimensional Fire code is a two-dimensional cyclic code ... View full abstract»

• ### Photocounting array receivers for optical communication through the lognormal atmospheric channel--III: Error bound forM-ary equal-energy orthogonal signaling (Corresp.)

Publication Year: 1973, Page(s):807 - 809
Cited by:  Papers (4)
| | PDF (330 KB)

A bound on the probability of error is obtained for anM-ary direct-detection optical communications system consisting of an amplitude-stabilized source, a lognormal atmospheric channel, and a photocounting detector array. Equal-energy, equiprobable, orthogonal signaling, and fiat independent fading at all detectors is assumed. The result reduces to that obtained previously in the absenc... View full abstract»

• ### Sampled data reconstruction of deterministic band-limited signals (Corresp.)

Publication Year: 1973, Page(s):809 - 811
Cited by:  Papers (8)
| | PDF (468 KB)

In obtaining a discrete set of data points to represent a signal, the problem of how to obtain sufficient information about the signal can become pronounced if the rate of obtaining samples of the signal is limited. The multiple-channel interpolation scheme presented in this correspondence uses periodic samples of the output of a set of prefilters excited by a deterministic input signal to reconst... View full abstract»

• ### Bounds on the performance of a class of digital communication systems (Corresp.)

Publication Year: 1973, Page(s):811 - 815
Cited by:  Papers (1)
| | PDF (499 KB)

Bounds on the capacity of a class of digital communication channels are derived. Equating the bounds on capacity to rate-distortion functions of (typical) sources in turn produces bounds on the performance of a class of digital communication systems. For ratios of squared quantization level to noise variance much !ess than one, the power requirements for this class of digital communication systems... View full abstract»

• ### Some comments on the generalized Shannon lower bound for stationary finite-alphabet sources with memory (Corresp.)

Publication Year: 1973, Page(s):815 - 817
| | PDF (505 KB)

We consider a class of strictly stationary binary sources<tex>\{u_n, n \geq 1\}</tex>, characterized by joint conditional probability mass functions $$Q_n(U_n = k_n \mid \theta) = \prod_{i=1}^n \theta^{1-k_i} (1 - \theta)^{k_i}$$ for all<tex>n \geq 1</tex>, where<tex>\theta</tex>is an r.v. on View full abstract»

• ### Extended double-error-correcting binary Goppa codes are cyclic (Corresp.)

Publication Year: 1973, Page(s):817 - 818
Cited by:  Papers (28)
| | PDF (289 KB)

The class of codes introduced by Goppa [1]-[3] includes the BCH codes as a proper subset. It also includes a large subset of asymptotically good codes, each of which has an algebraic decoding algorithm for correcting some smaller number of errors. In Section 7 of [1], Goppa gives necessary and sufficient conditions for his codes to be isomorphic to cyclic codes under a certain correspondence. In t... View full abstract»

• ### Shortened BCH codes (Corresp.)

Publication Year: 1973, Page(s):818 - 820
Cited by:  Papers (21)  |  Patents (2)
| | PDF (459 KB)

By shortening certain binary primitive BCH codes, we derive a number of linear error-correcting codes with minimum distances superior to any known previously. We also give the weight spectra of three nonprimitive BCH codes whose minimum distances likewise constitute a significant improvement over those of the best codes previously known. View full abstract»

• ### On some classes of cyclic codes of composite length (Corresp.)

Publication Year: 1973, Page(s):820 - 823
Cited by:  Papers (4)
| | PDF (754 KB)

Some new lower bounds on the minimum distance of cyclic codes of composite length are presented. These bounds generalize some existing bounds and give better estimates of the minimum distance for a wide range of cyclic codes, Lower bounds on the random-error-correction capability of a particular class of cyclic codes of composite length<tex>n = n_1n_2</tex>, where<tex>n_1</tex... View full abstract»

• ### On arithmetic weight for a general radix representation of integers (Corresp.)

Publication Year: 1973, Page(s):823 - 826
Cited by:  Papers (33)  |  Patents (2)
| | PDF (656 KB)

In this correspondence we define a "nonadjacent form" for integers in an arbitrary radix<tex>r &gt; 1</tex>. This form is proved to be unique, and the arithmetic weight of an integer is shown to be equal to the number of nonzero terms in the form. Two algorithms are presented for the computation of this form. If<tex>r = 2</tex>, our form coincides with the well-known mo... View full abstract»

• ### Comments on "The Early Days of Information Theory

Publication Year: 1973, Page(s): 826
| PDF (125 KB)
• ### Correction to 'Recent Progress in Stochastic Processes - A Survey'

Publication Year: 1973, Page(s): 826
| PDF (125 KB)
• ### Review of five specific books on pattern recognition

Publication Year: 1973, Page(s):827 - 833
| PDF (1168 KB)
• ### On the decomposition of cyclic codes into cyclic classes (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 834
| PDF (146 KB)
• ### Techniques for classification and feature extraction: Analysis of variance and factor analysis based on stochastic approximation (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 834
| PDF (146 KB)
• ### Recursive equalization in data transmission (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 834
| PDF (146 KB)
• ### Fixed and variable threshold robust procedures for classifying one- and two-dimensional patterns (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s):834 - 835
| PDF (334 KB)
• ### Detection and estimation of an optical image by photon-counting techniques (Ph.D. Thesis abstr.)

Publication Year: 1973, Page(s): 835
| PDF (148 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