IEEE Transactions on Information Theory

Volume 20 Issue 1 • January 1974

Filter Results

Displaying Results 1 - 25 of 32
  • Error probabilities in binary angle modulation

    Publication Year: 1974, Page(s):36 - 42
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1093 KB)

    It is shown that many signal-detection problems involving binary phase and frequency modulation can be solved by considering the problem as the convolution of two independent phase distributions. When the two distributions are similar and each represents the probability density function of the phase of a sinusoid in noise, the probability of error is described in terms of modified Bessel functions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deterministic approach to variable-step delta modulation

    Publication Year: 1974, Page(s):58 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (927 KB)

    A study is described of delta modulators where the quantizing parameterDeltais a function of a finite number of previously emitted bits. Sufficient conditions are obtained for bounding the steady-state quantization error by the current value ofDeltaunder the assumption that input signals are limited both in amplitude and frequency. The nonlinear problem associated with determ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree encoding for symmetric sources with a distortion measure

    Publication Year: 1974, Page(s):65 - 76
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1785 KB)

    A simple algorithm is developed for mapping the outputs of a source into the set of code sequences generated by a tree code. The algorithm is analyzed for a special case in which the source produces discrete independent equiprobable letters, and the distortion measure satisfies a symmetry condition. LettingRbe the code rate andD^{ast}be the minimum average distortion for that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new theorem about the Mattson-Solomon polynomial, and some applications

    Publication Year: 1974, Page(s):85 - 89
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    LetF = GF(2), andFG = F[x]/(x^n + 1). FGis the residue class ring of polynomials modx^n + 1. An element ofFGis represented by a polynomial of degree at mostn - 1begin{equation} c(x) = c_0 + c_1 x + cdots + c_{n-1} x^{n-1} end{equation} with coefficients inF. It may also be represented by a polynomial begin{equation} g(z) = sum_{j=0}... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coarse frequency estimation using the discrete Fourier transform (Corresp.)

    Publication Year: 1974, Page(s):104 - 109
    Cited by:  Papers (70)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    The discrete Fourier transform (DFT) is applied as a coarse estimator of the frequency of a sine wave in Gaussian noise. Probability of anomaly and the variance of the estimation error are determined by computer simulation for several DFT block sizes as a function of signal energy-to-noise density ratiomathcal{E}/N_0. Several data windows are considered, but uniform weighting gives the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic statistics of periodogram-type spectral estimates for the output of nonlinear devices (Corresp.)

    Publication Year: 1974, Page(s):109 - 111
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The high resolution statistics of a periodogram-type spectral estimate for a periodic deterministic signal plus Gaussian noise are well understood. If, however, the signal plus noise is first passed through a nonlinear memoryless device (such as a hard limiter), the situation becomes much more complicated. The main result of this correspondence is the derivation of the high resolution limit of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bibliography on digital graphic image compression and quality (Corresp.)

    Publication Year: 1974, Page(s):120 - 122
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (519 KB)

    This bibliography lists published papers that specifically relate to the compression or quality of digitized images of graphics data. By graphics data we mean printed matter, handwriting, line drawings, or any image data that is basically two-level: information on background. The data compression covered here assumes information reduction to images with two levels of signal amplitude followed by r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the computation of rate-distortion functions (Corresp.)

    Publication Year: 1974, Page(s):122 - 124
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB)

    In a recent paper [1], Blahut suggested an efficient algorithm for computing rate-distortion functions. In this correspondence we show that the sequence of distributions used in that algorithm has a limit yielding a point on theR(d)curve if the reproducing alphabet is finite, and we obtain a similar but weaker result for countable reproducing alphabets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the fractional weight of distinct binaryn-tuples (Corresp.)

    Publication Year: 1974, Page(s): 131
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (126 KB)

    It is shown that the fractionpof ones in theMnpositions ofMdistinct binaryn-tuples satisfies the inequality begin{equation} h(p) geq (l/n) log_2 M end{equation} whereh(p) = - p log_2 p - (1 - p) log_2 (1 - p)is the binary entropy function. This inequality, which simplifies the derivation of the distance property of the Justesen codes, is prove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On binary majority-logic decodable codes (Corresp.)

    Publication Year: 1974, Page(s):131 - 133
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB)

    LetVprimebe a binary(n,k)majority-logic decodable code withgprime (X)as its generator polynomial and odd minimum distanced. LetVbe the(n, k - 1)subset code generated bygprime (X)(1 + X). This correspondence shows thatVis majority-logic deeodable withd + 1orthogonal estimates. This fact is useful in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some rate-p/(p+1)quasi-cyclic codes (Corresp.)

    Publication Year: 1974, Page(s):133 - 135
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    Some optimal rate-frac{1}{2}quasi-cyclic codes found by Chert et aL [3] are grouped into a small set of equivalence classes with the assistance of a computer. The weight distribution of a selection of these rate-frac{1}{2}codes is tabulated. In addition, a list of new optimal rate-frac{2}{3}quasi-cyclic codes of lengths up to 54 is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A self-dual even (96, 48, 16) code (Corresp.)

    Publication Year: 1974, Page(s):136 - 138
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (526 KB)

    IfC_1, C_2are two codes of the same length, letC_1 neq C_2 = {(alpha + eta,beta + eta, alpha + beta + eta) mid alpha, beta in C_1, eta in C_2}. TakingC_1andC_2to be two extended quadratic residue codes of length 32, it is shown thatC_1 neq C_2is a (96,48,16) self-dual even code with all weights divisible by 4. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error intervals and cluster density in channel modeling (Corresp.)

    Publication Year: 1974, Page(s):125 - 129
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    This correspondence is concerned with binary processes and presents results with immediate applications in the modeling of digital channels for the purpose of evaluating code performance. It is demonstrated that cluster density can be analytically described from the distributions of intervals between errors. These relations and derived clustering properties hold for any stationary process. Analyse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalization of Huffman coding for messages with frequencies given by upper and lower bounds (Corresp.)

    Publication Year: 1974, Page(s):124 - 125
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    A generalization of the Huffman coding procedure is given for cases in which the source letter probabilities are known only to fall in certain ranges. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed-memory recursive filters (Corresp.)

    Publication Year: 1974, Page(s):113 - 115
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    This correspondence presents three algorithms for computing least-squares estimates based on fixed amounts of data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Configuration matrices of group codes

    Publication Year: 1974, Page(s):95 - 100
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Properties of configuration matrices of group codes for the Gaussian channel are considered. It is shown that the configuration matrix of a code generated by a real-irreducible representation is a scalar multiple of an idempotent matrix. A spectral resolution of the configuration matrix of a code generated by an arbitrary real representation is given, and all of its eigenvalues are determined. A r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Permutation codes for discrete channels (Corresp.)

    Publication Year: 1974, Page(s):138 - 140
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    A class of nonlinear codes for discrete channels is defined with the use of permutation groups. Several examples of such codes are given; their parameters are similar to those for Reed-Solomon codes in some cases. Decoding algorithms are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information-theoretic computation complexity

    Publication Year: 1974, Page(s):10 - 15
    Cited by:  Papers (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    This paper attempts to describe, in nontechnical language, some of the concepts and methods of one school of thought regarding computational complexity. It applies the viewpoint of information theory to computers. This will first lead us to a definition of the degree of randomness of individual binary strings, and then to an information-theoretic version of Gödel's theorem on the limitations ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding for a delay-dependent fidelity criterion

    Publication Year: 1974, Page(s):77 - 85
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB)

    Coding for fidelity criteria, dependent upon the time delay of coding and transmission, is studied from an information-theoretic viewpoint. The results presented here, unlike the conventional Shannon theory, show that the optimum code frequently has finite block length. By extending some rate-distortion theory results, coding theorems and converses are proven. These suggest a procedure for boundin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phase tracking and demodulation with delay

    Publication Year: 1974, Page(s):50 - 58
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1344 KB)

    Algorithms are described for estimating carrier phase by a maximum-likelihood procedure similar to the Viterbi algorithm for decoding a digital sequence. These algorithms avoid the constraint of physical realizability imposed by a phase-locked loop and allow a processing lag in estimation. An approximate analysis suggests that threshold extension can be achieved thereby. Computer simulations demon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Frame-to-frame coding of television pictures using two-dimensional Fourier transforms (Corresp.)

    Publication Year: 1974, Page(s):119 - 120
    Cited by:  Papers (10)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Two systems are described for reducing the data rate required to transmit TV signals. Basic to the operation of both systems is the fact that if there is an object in the scene moving more or less in linear translation, then the two-dimensional frame-difference signal computed during the present frame will be very similar to the frame-difference signal which was computed during the previous frame ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent results in the Shannon theory

    Publication Year: 1974, Page(s):2 - 10
    Cited by:  Papers (334)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1600 KB)

    The first part of this paper consists of short summaries of recent work in five rather traditional areas of the Shannon theory, namely: 1) source and channel coding theorems for new situations; 2) calculation of source rate and channel capacity; 3) channel coding with feedback; 4) source coding; 5) universal coding. The second part of thc paper consists of a relatively detailed discussion of some ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the convergence interval of the power cepstrum (Corresp.)

    Publication Year: 1974, Page(s):111 - 112
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    It is shown that in cepstrum analysis of multipath signals the stringent conditions imposed on the strength of the delayed echo a can be relaxed to require at most only that a be different from one. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal detection in the presence of multiple-access noise

    Publication Year: 1974, Page(s):42 - 49
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    In this paper we address the mutual interference problems that arise as a result of many independent terminals simultaneously accessing a common channel. "Random code" bounds are used to show the existence of large signal sets for which any one signal can be reliably detected by matched filters despite the mutual interference. Two types of signal sets are considered: sets with a unique signature f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Glave's upper bound to the error probability for correlated digital signals (Corresp.)

    Publication Year: 1974, Page(s):115 - 119
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    A generalized method is presented for the computation of peak and rms values of intersymbol interference in correlated digital PAM signals. These values can be used to compute a recently proposed upper bound on the error probability for such signals. 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