IEEE Transactions on Information Theory

Volume 18 Issue 2 • March 1972

Filter Results

Displaying Results 1 - 25 of 37
  • A solution to the matrix factorization problem

    Publication Year: 1972, Page(s):225 - 232
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1087 KB)

    The spectral factorization of para-Hermitian matrices is often required in problems of filtering theory, network synthesis, and control systems design. An algebraic factorization technique is developed. The factorization of the matrix<tex>\Phi(s)</tex>is shown to be directly determined by the unique solution of a system of linear matrix equations. The labor of the method is reduced whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-dimensional discrete Markovian fields

    Publication Year: 1972, Page(s):232 - 240
    Cited by:  Papers (254)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1085 KB)

    A definition of discrete Markovian random fields is formulated analogously to a definition for the continuous case given by Lévy. This definition in the homogeneous Gaussian case leads to a difference equation that sets forth the state of the field in terms of its values on a band of minimum widthP, wherePis the order of the process. The state of the field at position(i,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detectors for discrete-time signals in non-Gaussian noise

    Publication Year: 1972, Page(s):241 - 250
    Cited by:  Papers (216)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1260 KB)

    The structure and performance of a class of nonlinear detectors for discrete-time signals in additive white noise are investigated. The detectors considered consist of a zero-memory nonlinearity (ZNL) followed by a linear filter whose output is compared with a threshold. That this class of detectors is a reasonable one to study is apparent from the fact that both the Neyman-Pearson optimum and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric detectors based on m-interval partitioning

    Publication Year: 1972, Page(s):251 - 257
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (841 KB)

    A new class of nonparametric detectors based on<tex>m</tex>- interval partitioning is introduced. It is easier to treat analytically and implement practically than the widely used class of nonparametric detectors based on rank partitioning of the received signal space. In addition, these new detectors are robust or relatively insensitive to the underlying noise distribution. If the qua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of discrete signal-design problems in burst noise

    Publication Year: 1972, Page(s):258 - 262
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (751 KB)

    The design of useful signaling alphabets in a burst-noise environment is treated as a discrete signal-design problem. A binary alphabet with minimum Gabor bandwidth is formulated as a discrete optimization problem to illustrate the design philosophy. The solution is obtained by using an eigenvalue approach. This technique is extended to the design of signals in a burst-noise environment where the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stochastic approximation method for waveform cluster center generation

    Publication Year: 1972, Page(s):262 - 274
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2028 KB)

    A method is presented that detects behavioral transients in waveforms. A structure is defined that accepts waveforms as inputs and generates a sequence of symbols representing the sequence of transients present in the waveform. This structure is developed by generalizing an unsupervised learning algorithm to the time-varying case. The algorithm accepts a sequence of unlabeled waveforms to find clu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Eliminating intersymbol interference -- A state-space approach

    Publication Year: 1972, Page(s):275 - 281
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (939 KB)

    The problem of eliminating intersymbol interference is studied from the viewpoint of channel-state estimation. The channel state vector, at the beginning of the present message baud, contains the information required to eliminate the effects of past channel inputs. A receiver is proposed that makes a maximum-likelihood estimate of the channel state vector conditioned upon all previous digits havin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization of codes by means of Kautz's Fibonacci encoding

    Publication Year: 1972, Page(s):281 - 285
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (725 KB)

    It is shown how to detect or correct synchronization slippage in cyclic codes by using a prefix that incorporates the Fibonacci encoding technique developed by Kautz. Comparison with other methods shows that in many cases it seems to be more efficient. Implementation is simple. It is also shown how a similar technique can be used in comma-free codes. The resulting codes can be constructed algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some classes of multiple-burst-error-correcting codes using threshold decoding

    Publication Year: 1972, Page(s):285 - 292
    Cited by:  Papers (2)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    A class of quasi-cyclic multiple-burst-error-correcting codes are constructed in which threshold decoding is used. These codes resemble the interlaced self-orthogonal quasi-cyclic random-error-correcting codes constructed by Townsend and Weldon, but the interlacing depends on the parity-check equations used. These parity-check equations are based on difference triangles that were introduced by Rob... View full abstract»

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

    Publication Year: 1972, Page(s):292 - 297
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (759 KB)

    Srivastava codes, a class of linear noncyclic error-correcting codes, offer performance potentially superior tO that of comparable BCH codes. Their properties are investigated by equivalence classification and subsequent computer evaluation of their weight spectra. In the process a constructive upper bound is obtained on the number of equivalence classes of Srivastava codes, a class of binary Sriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Moments of the sum of circularly symmetric random variables (Corresp.)

    Publication Year: 1972, Page(s):297 - 298
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB)

    Let<tex>(X_1,Y_1), \cdots ,(X_N, Y_N)</tex>be<tex>N</tex>independent pairs of circularly symmetric random variables, A simple expression is derived for the even moments of the (Euclidean) norm of the vector sum<tex>(X_1, Y_1)</tex>+<tex>\cdots + (X_N, Y_N)</tex>in terms of the moments of<tex>(X_i ^2 + Y_i ^2)^{1/2}, i = 1,\cdots,N</tex>. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal smoothing of piecewise continuous functions (Corresp.)

    Publication Year: 1972, Page(s):298 - 300
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (502 KB)

    Given an observation vector<tex>y = Ax + \nu</tex>, estimate the parameter vector<tex>x</tex>subject to the known constraint relationship<tex>Kx = 0</tex>. The covariance matrix<tex>R</tex>of the measurement error<tex>\nu</tex>and<tex>A</tex>are known block diagonal matrices. The best linear unbiased estimate of<tex>x<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parametric procedure for learning with an imperfect teacher (Corresp.)

    Publication Year: 1972, Page(s):300 - 302
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (521 KB)

    Pattern recognition problems involving learning with a bad teacher or learning without a teacher require the updating of the conditional densities of unknown parameters using a mixture of probability density functions. Mixtures of density functions in general are not reproducing and hence the computations are infeasible. For learning without a teacher, a computationally feasible scheme has been su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel capacity and maximum-likelihood detection for atmospherically disturbed binary photocounting communications (Corresp.)

    Publication Year: 1972, Page(s):302 - 304
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (539 KB)

    A binary optical communication system, consisting of a laser transmitter, a log-normal atmospheric channel, a photocounting detector, and a likelihood-ratio decision box has been investigated. Background radiation and dark current have been taken into account. Curves are presented for the probability of error and the mutual information for varying levels of atmospheric turbulence. It was ascertain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The systematic selection of cyclically equivalent codes (Corresp.)

    Publication Year: 1972, Page(s):304 - 307
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (669 KB)

    A systematic procedure for constructing one member of each cyclic equivalence class of an<tex>(n, k + 1)</tex>Reed-Solomon code is presented. It is shown that if the procedure is modified to exclude those codewords that do not have maximum period, the resulting set of codewords constitutes a synchronizable code having comma freedom of degree<tex>n - 2k</tex>. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound for cyclic codes of composite length (Corresp.)

    Publication Year: 1972, Page(s): 307
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (118 KB)

    An upper bound on the minimum distance of cyclic codes of composite length is presented. This upper bound proves the BCH bound to be exact for many cyclic codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound for arithmetic codes of composite length (Corresp.)

    Publication Year: 1972, Page(s): 308
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (134 KB)

    This correspondence presents an upper bound on the minimum distance of arithmetic codes of composite length<tex>n = n_1 n_2</tex>. The tightness of this bound gives a rather good working estimate of the minimum distance of a prospective code. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further results on majority-logic decoding of product codes (Corresp.)

    Publication Year: 1972, Page(s):308 - 310
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (523 KB)

    In this correspondence additional results on majority-logic decoding of product codes are presented. If one of the component codes is decodable using Rudolph's nonorthogonal algorithm, and the other using Reed-Massey's<tex>L</tex>-step orthogonalization, then the resulting product code is majority-logic decodable in<tex>L</tex>steps, where nonorthogonal checks are used in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the survival of sequence information in filters (Corresp.)

    Publication Year: 1972, Page(s):310 - 312
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    Given a binary data stream<tex>A = \{a_i\}_{i=o}^\infty</tex>and a filter<tex>F</tex>whose output at time<tex>n</tex>is<tex>f_n = \sum_{i=0}^{n} a_i \beta^{n-i}</tex>for some complex<tex>\beta \neq 0</tex>, there are at most<tex>2^{n +1)</tex>distinct values of<tex>f_n</tex>. These values are the sums of the subset... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Notes on Analog Communication' (Sakrison, D. J.; 1970)

    Publication Year: 1972, Page(s): 313
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Review of 'The State-Variable Approach to Continuous Estimation, with Applications to Analog Communication Theory' (Snyder, D. L.; 1969)

    Publication Year: 1972, Page(s): 314
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE
  • Methods of wide-band signal design for radar and sonar systems (Ph.D. Thesis abstr.)

    Publication Year: 1972, Page(s): 314
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution-free and nonparametric sequential signal detection (Ph.D. Thesis abstr.)

    Publication Year: 1972, Page(s): 314
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On variable-length codes and the buffer smoothing problem (Ph.D. Thesis abstr.)

    Publication Year: 1972, Page(s): 315
    Request permission for commercial reuse | PDF file iconPDF (167 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chernoff bounds on the error probability for the detection of non-Gaussian signals (Ph.D. Thesis abstr.)

    Publication Year: 1972, Page(s): 315
    Request permission for commercial reuse | PDF file iconPDF (167 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