IEEE Transactions on Information Theory

Volume 23 Issue 1 • January 1977

Filter Results

Displaying Results 1 - 25 of 28
  • A survey of multi-way channels in information theory: 1961-1976

    Publication Year: 1977, Page(s):1 - 37
    Cited by:  Papers (195)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5029 KB)

    The advances in the area of multi-way channels during the period 1961-1976 are described. Shannon's two-way channel, the multiple-access channel, the interference channel, the broadcast channel, and the relay channel are treated successively. Only channel coding aspects are discussed. Thirty-nine open problems are mentioned. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of balanced binary sequences with optimal autocorrelation properties

    Publication Year: 1977, Page(s):38 - 42
    Cited by:  Papers (97)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (686 KB)

    The construction of a class of balanced binary sequences with optimal autocorrelation properties is described. Given any odd prime<tex>p</tex>and any positive integer<tex>m</tex>, a balanced<tex>( \pm 1)</tex>binary sequence of length<tex>p^{m} - 1</tex>whose cyclic autocorrelation function<tex>c (\tau)</tex>satisfies<tex>c (0) = p^... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sieves for low autocorrelation binary sequences

    Publication Year: 1977, Page(s):43 - 51
    Cited by:  Papers (106)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (994 KB)

    The value<tex>2e^{2}</tex>is calculated by approximations as a conjectured asymptotic limit for the best central to sidelobe energy ratio of very long low autocorrelation binary sequences. The same bound is calculated by approximation for skewsymmetric sequences, hence it is concluded that the requirement of skewsymmetry constitutes a powerful and effective sieve for the search for nea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit bounds to R(D) for a binary symmetric Markov source

    Publication Year: 1977, Page(s):52 - 59
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    A new upper hound<tex>R_{u}(D)</tex>and lower hound<tex>R_{\ell}(D)</tex>are developed for the rate-distortion function of a binary symmetric Markov source with respect to the frequency of error criterion. Both hounds are explicit in the sense that they do not depend on a blocklength parameter. In the interval<tex>D_{c} &lt; D &lt; 1/2 = D_{max}</tex>, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General broadcast channels with degraded message sets

    Publication Year: 1977, Page(s):60 - 64
    Cited by:  Papers (171)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A broadcast channel with one sender and two receivers is considered. Three independent messages are to be transmitted over this channel: one common message which is meant for both receivers, and one private message for each of them. The coding theorem and strong converse for this communication situation is proved for the case when one of the private messages has rate zero. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source code error bound in the excess rate region

    Publication Year: 1977, Page(s):65 - 70
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The problem of encoding a discrete memoryless source with respect to a single-letter fidelity criterion, using a block code of length<tex>n</tex>and rate<tex>R</tex>, is considered. The probability of error,<tex>p_{n}(R,D)</tex>, is defined to be the minimum probability, over all such codes, that the source will generate a sequence which cannot be encoded with d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion

    Publication Year: 1977, Page(s):71 - 83
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2121 KB)

    The theory of sliding-block codes (nonlinear, time-invariant, discrete-time filters) is employed to obtain general source coding theorems for ergodic sources using time-invariant trellis coding (time-invariant decoding filter and replicating trellis). The results are coupled with the theory of universal block source codes to obtain universal trellis source coding theorems for classes of sources. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of a memoryless nonlinearity on the spectrum of a random process

    Publication Year: 1977, Page(s):84 - 89
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (942 KB)

    It is shown that, for a Gaussian process and for some non-Gaussian processes, any memoryless nonlinearity has a whitening effect in the sense that the output spectrum is smoother and occupies a greater bandwidth than the input spectrum. The ratio between input and output bandwidths is investigated by using several measures of bandwidth. Also, it is shown that classes of nonlinearities exist that a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extension to the maximum entropy method

    Publication Year: 1977, Page(s):89 - 93
    Cited by:  Papers (33)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (771 KB)

    The maximum entropy method provides an estimate of the power spectral density which maximizes the entropy of a stationary random process from the first<tex>N</tex>lags of the autocorrelation function. The method is extended to accommodate weighted errors in the measured autocorrelation function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The estimator-correlator for discrete-time problems

    Publication Year: 1977, Page(s):93 - 100
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1204 KB)

    A class of discrete-time detection problems is formulated and a general recursive formula for the likelihood ratio is obtained. The result is analogous to the general likelihood-ratio formula or "estimator-correlator" receiver which has been derived in continuous time for a number of detection problems. As in the continuous-time versions, a conditional-mean estimate again plays a central role in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Likelihood ratios for sequential hypothesis testing on Markov sequences

    Publication Year: 1977, Page(s):101 - 109
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1439 KB)

    A variety of likelihood ratios are derived for detecting Gauss-Markov and finite-state Markov sequences in additive Gaussian noise. The Bayesian recursions appropriate to related filtering problems are exploited, together with "known-form" likelihood ratios, to obtain the desired results. In the derivation of a discrete-time Gauss-Markov likelihood ratio, a "pure" causal estimator-correlator struc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exponential Fourier densities and optimal estimation and detection on the circle

    Publication Year: 1977, Page(s):110 - 116
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    A new representation, called an exponential Fourier density, of a probability density on a circle,<tex>S^{1}</tex>is introduced. It is shown that a density of bounded variation on<tex>S^{1}</tex>can be approximated as closely as desired by such a representation in the space of square-integrable functions on<tex>S^{1}</tex>. The exponential Fourier densities have... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal reception of digital data over the Gaussian channel with unknown delay and phase jitter

    Publication Year: 1977, Page(s):117 - 126
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1454 KB)

    Asymptotically optimum (in the sense of minimum per-symbol error rate) receiver structures for data communication over the white Gaussian channel with unknown time delay and carrier phase jitter are developed. The receiver structures apply to the following suppressed-carrier modulation systems: double sideband (DSB), quadrature amplitude modulation (QAM) with an arbitrary constellation, vestigial ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enumeration of minimal convolutional encoders (Corresp.)

    Publication Year: 1977, Page(s):127 - 132
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (709 KB)

    A general ensemble of all rate<tex>K/N</tex>convolutional encoders with overall constraint length (OCL)<tex>\nu</tex>is considered, and the notion of a minimum overall constraint length (MOCL) encoder is introduced. The noncatastrophic subclass of this class of zero delay MOCL encoders is the class of minimal encoders. Using this fact, upper and lower bounds on the number o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The extended Nadler code is unique (Corresp.)

    Publication Year: 1977, Page(s):132 - 135
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Constructions for a 32-word binary code of length 12 and minimum distance 5 were given by Nadler in 1962 and van Lint in 1972. These codes are not equivalent as their distance distributions are not the same. That their extended codes of length 13 are equivalent is proved. It is shown that up to a permutation of the coordinates, there is an essentially unique way to construct the extended code. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On fast M-sequence transforms (Corresp.)

    Publication Year: 1977, Page(s):135 - 137
    Cited by:  Papers (81)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (434 KB)

    The equivalence of<tex>M</tex>-sequence matrices to Walsh-Hadamard matrices can be exploited to take advantage of the latter's fast transform algorithm. The nature of the obvious equivalence, its relation to the<tex>M</tex>-sequence and its implementation as address modifications realized by linear feedback shift-registers are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for decoding of generalized Goppa codes (Corresp.)

    Publication Year: 1977, Page(s):137 - 140
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (645 KB)

    It is shown how the theory of continued fractions for polynomials can be used for the decoding of a class of codes which contains Goppa codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Absolute value optimization to estimate phase properties of stochastic time series (Corresp.)

    Publication Year: 1977, Page(s):140 - 143
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Most existing deconvolution techniques are incapable of determining phase properties of wavelets from time series data; to assure a unique solution, {\em minimum phase} is usually assumed. It is demonstrated, for moving average processes of order one, that deconvolution filtering using the absolute value norm provides an estimate of the wavelet shape that has the correct phase character when the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically optimal quantizers (Corresp.)

    Publication Year: 1977, Page(s):143 - 144
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB)

    Asymptotically accurate approximations for quantizer performance were developed by Gish and Pierce. Variational techniques were used to obtain asymptotically optimal performance. In this correspondence, optimal performance is demonstrated simply without variational techniques using Holder's and Jensen's inequalities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Walsh analysis of power-law systems (Corresp.)

    Publication Year: 1977, Page(s):144 - 146
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Walsh-type signals exciting memoryless power-law systems are considered. The input is assumed to consist of a sum of weighted Walsh functions. A method is given for finding the weights of the Walsh functions in the output when the input is a finite Walsh series. It is shown that the fast Walsh transform can be used to facilitate the necessary computation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'The Statistical Analysis of Space-Time Point Processes'

    Publication Year: 1977, Page(s):146 - 147
    Request permission for commercial reuse | PDF file iconPDF (337 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Optical Communications' (Gagliardi, R. M., and Karp, S.; 1976)

    Publication Year: 1977, Page(s):147 - 148
    Request permission for commercial reuse | PDF file iconPDF (407 KB)
    Freely Available from IEEE
  • Review of 'Automata Theory: An Engineering Approach' (Aleksander, I., and Hanna, F. K.; 1975)

    Publication Year: 1977, Page(s):148 - 149
    Request permission for commercial reuse | PDF file iconPDF (431 KB)
    Freely Available from IEEE
  • Review of 'Introduction to Nonparametric Detection with Applications' (Gibson, J. D., and Melsa, J. L.; 1975)

    Publication Year: 1977, Page(s): 149
    Request permission for commercial reuse | PDF file iconPDF (346 KB)
    Freely Available from IEEE
  • Sequential partition detectors with applications (Ph.D. Thesis abstr.)

    Publication Year: 1977, Page(s): 151
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu