IEEE Transactions on Information Theory

Volume 15 Issue 1 • January 1969

Filter Results

Displaying Results 1 - 25 of 42
  • Hard limiting of three and four sinusoidal signals

    Publication Year: 1969, Page(s):2 - 7
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    An analysis of the effect of hard limiting on a sum of three or four sinusoidal signals has been performed. Analytic expressions are obtained for the output amplitudes for three input signals, two of equal amplitude, and for four signals, amplitudes equal in pairs. The results are compared with previous investigations that employ digital computer simulation, and excellent agreement is obtained. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the output of FM correlation systems

    Publication Year: 1969, Page(s):7 - 16
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1266 KB)

    By the term "FM correlation system," we mean the analog correlation system that consists of two channels, each containing an FM detector. Expressions are derived for the output of the FM correlation system for the following cases. Each channel input to be correlated is a conventional FM signal plus Gaussian noise; and each input is an amplitude-limited or a nonlimited narrow-band Gaussian random s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the deflection of a quadratic-linear test statistic

    Publication Year: 1969, Page(s):16 - 21
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    The deflection of a bounded quadratic-linear test statistic is considered for the following binary detection problem. Hypothesis<tex>H_{1}</tex>--received waveform is a sample function from a random process with known covariance and mean functions, but unknown probability distributions, versus<tex>H_{2}</tex>--received waveform is a sample function from a Gaussian process (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection and parameter estimation in an amplitude-comparison monopulse radar

    Publication Year: 1969, Page(s):22 - 30
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1433 KB)

    This paper considers the problem of detecting and estimating the unknown angular location of a radar target that is observed simultaneously by a number of antennas. The amplitude of the signal received by a particular antenna is assumed to depend on the angular location of the target, but the time of arrival of the signal is assumed to be the same at all of the antennas. The generalized likelihood... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication under the Poisson regime

    Publication Year: 1969, Page(s):31 - 37
    Cited by:  Papers (91)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1050 KB)

    By "Poisson regime" we mean a model in which intelligence is communicated by random discrete occurrences in time that obey Poisson statistics of arbitrarily time-varying mean, as for example when modulated electromagnetic radiation and background radiation at optical frequencies is incoherently detected by photon-sensitive surfaces. The problems of optimal detection of signals of arbitrary shape a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum bandwidth of M signals with specified code or correlation matrix

    Publication Year: 1969, Page(s):38 - 48
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1221 KB)

    The minimum bandwidth of<tex>M</tex>real equi-energy signals is derived for the cases of either a specified code or a specified correlation matrix. The definition of bandwidth is in terms of the ratio of the energy passed by a linear time-invariant filter to the input energy, and incorporates a great variety of definitions. In one instance, the signals are time limited; in a second, a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The asymptotic error probability for transmission of orthogonal signals over the generalized incoherent channel

    Publication Year: 1969, Page(s):48 - 52
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The probability of error for the transmission of one of<tex>M</tex>-orthogonal, equally likely, equal-energy signals over the white Gaussian noise channel is known. For large values of<tex>T</tex>it is shown that this result is asymptotically equivalent to the error probability for the same signal set transmitted over a different channel, termed here the generalized incoher... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving communication reliability by use of an intermittent feedback channel

    Publication Year: 1969, Page(s):52 - 60
    Cited by:  Papers (52)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1162 KB)

    This paper describes and analyzes a feedback communication scheme where the feedback channel is used only to inform the transmitter, at specified times (prior to a final decision), which message the receiver considers most likely. The feedback information is used by the transmitter to modify its transmission according to a rule known also to the receiver. When orthogonal signals are used and only ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal communication systems with noiseless feedback for a binary source and white Gaussian channel

    Publication Year: 1969, Page(s):61 - 66
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (818 KB)

    The sequential and nonsequential feedback systems for a binary source, first proposed by Turin, are considered. It is shown that in both cases the optimal signals belong to the family<tex>\pm A (y)[1 + \exp (\pm y)]^{-1}</tex>, where<tex>A(y)</tex>is arbitrary. In the sequential scheme the bound on transmission rate is achieved for any<tex>P_{e}</tex>by all memb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of rate-distortion theory to a converse to the coding theorem

    Publication Year: 1969, Page(s):66 - 71
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (783 KB)

    A lower bound to the information rate<tex>R(D)</tex>for a discrete memoryless source with a fidelity criterion is presented for the case in which the distortion matrix contains the same set of entries, perhaps permuted, in each column. A necessary and sufficient condition for<tex>R(D)</tex>to equal this bound is given. In particular, if the smallest column element is zero a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of mean-square error for data transmitted via group codes

    Publication Year: 1969, Page(s):72 - 78
    Cited by:  Papers (51)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (611 KB)

    We show how to find solutions to the problem considered by Mitryayev [l ] in the case where the loss power function is quadratic. This problem is to minimize mean-square error when digital data is represented by group code combinations and the a priori probability distribution is uniform. Furthermore, it is shown that there is always a solution which is linear in the sense of Mitryayev. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized threshold decoding and the Reed- Solomon codes

    Publication Year: 1969, Page(s):78 - 81
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (610 KB)

    A necessary condition for the existence of a set of<tex>J</tex>orthogonal parity check equations is developed, and it is demonstrated that, except for the trivial codes, the Reed-Solomon codes are not<tex>L</tex>-step orthogonalizable. Massey's concept of threshold decoding is generalized, and it is demonstrated that the Reed-Solomon codes are completely threshold decodable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New binary coding results by circulants

    Publication Year: 1969, Page(s):81 - 92
    Cited by:  Papers (83)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1898 KB)

    The Introduction contains a new circulant echelon canonical form for the perfect<tex>(23,12)</tex>Golay code and some tentative conclusions are suggested. Section I gives an account of the properties of circulant matrices<tex>A</tex>, and a number of lemmas that make it possible to determine the minimum weight of codes generated by the rows of a matrix of the form<tex>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matrix approach to synchronization recovery for binary cyclic codes

    Publication Year: 1969, Page(s):93 - 101
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    The problem of detecting and correcting loss of synchronization for binary cyclic codes is examined. The method used is to form a coset code from tho given<tex>(n, k)</tex>cyclic code by adding a suitable<tex>n</tex>vector to each cyclic code word before transmission. Unlike some other techniques, the length of the code word<tex>n</tex>is not altered. A code wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A family of codes for the correction of substitution and synchronization errors

    Publication Year: 1969, Page(s):102 - 106
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (855 KB)

    Binary block codes are constructed that are capable of correcting, in every<tex>t \geq 3</tex>consecutive words, either one substitution error in each one of, at the most,<tex>t-2</tex>words, or one synchronization error (but not both). In order to decode any one word, the decoder needs to wait for the reception of, at the most, the next<tex>t-1</tex>words. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction of synchronization errors with burst-error-correcting cyclic codes

    Publication Year: 1969, Page(s):106 - 109
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (615 KB)

    It is shown that every linear cyclic<tex>b</tex>-burst-error-correcting code over any finite field can be modified to correct up to<tex>(b-2)</tex>symbols of synchronization slippage without additional redundancy, while maintaining its additive error-correcting capability in the absence of synchronization errors. For codes that are interleaved to a degree<tex>m</te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Burst-correcting codes with high-speed decoding

    Publication Year: 1969, Page(s):109 - 113
    Cited by:  Papers (19)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    This paper describes a technique for high-speed decoding of burst-error-correcting codes and a class of codes most suitable for this purpose. With a small amount of additional circuitry the decoders proposed in this paper are capable of decoding speeds several orders of magnitude higher than those of conventional decoders. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of high-speed decoders for linear cyclic binary codes

    Publication Year: 1969, Page(s):113 - 117
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (689 KB)

    A general method is proposed for decoding any cyclic binary code at extremely high speed using only modulo<tex>2</tex>adders and threshold elements, and the decoders may be designed for maximum-likelihood decoding. The number of decoding cycles is a fraction of the number of digits in the code word. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes

    Publication Year: 1969, Page(s):118 - 121
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (655 KB)

    We consider the problem of determining which irreducible polynomials with coefficients in a finite field<tex>GF(q)</tex>are quasi-self-reciprocal. Our characterization of these polynomials is in terms of a set of positive integers,<tex>Dq</tex>.<tex>Dq</tex>has applications to certain BCH codes. This work determines those codes (as specified by<tex>n</t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shift-register synthesis and BCH decoding

    Publication Year: 1969, Page(s):122 - 127
    Cited by:  Papers (889)  |  Patents (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    It is shown in this paper that the iterative algorithm introduced by Berlekamp for decoding BCH codes actually provides a general solution to the problem of synthesizing the shortest linear feedback shift register capable of generating a prescribed finite sequence of digits. The shift-register approach leads to a simple proof of the validity of the algorithm as well as providing additional insight... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum distance estimates of the performance of sequential decoders

    Publication Year: 1969, Page(s):128 - 140
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1881 KB)

    In the past, criteria for predicting the performance of individual codes with sequential decoding have been intuitive. In this paper, simple tests are derived that allow easy determination of the performance on the BSC (binary symmetric channel) of a given binary convolutional code decoded with a modified version of the Fano algorithm. A "distance-guaranteed computational cutoff rate,"<tex>R... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on moments of sequential decoding effort

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

    In this paper we derive an infinite tree code ensemble upper bound on the<tex>\nu</tex>th<tex>(\nu \leq 1)</tex>moments of the computational effort connected with sequential decoding governed by the Fano \footnote[1]{algorithm}. It is shown that the<tex>\nu</tex>th moment of the effort per decoded branch is hounded by a constant, provided the transmission rate&l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Punctured uniform codes

    Publication Year: 1969, Page(s):149 - 152
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (586 KB)

    The structure of a uniform convolutional code, i.e., a code whose average distance is equal to its minimum distance, is examined, and results in a parity equation lattice. From this lattice, punctured uniform codes, i.e., uniform codes with parity bits deleted, are constructed, which can be threshold decoded and have limited error propagation. An "optimum" deletion sequence is provided. Some of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-propagation properties of uniform codes

    Publication Year: 1969, Page(s):152 - 161
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1618 KB)

    The problem of error propagation in uniform codes is investigated using the concept of parity-parallelogram submatrices and the threshold-decoding algorithm. A set of optimum orthogonalization rules is presented and it is shown that if these rules are incorporated into the decoder, then sufficient conditions can be found for the return of the decoder to correct operation following a decoding error... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'A Statistical Theory of Reverberation and Similar First-Order Scattered Fields. Parts I and II'

    Publication Year: 1969, Page(s):161 - 162
    Cited by:  Papers (3)
    Request permission for commercial reuse | PDF file iconPDF (248 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