IEEE Transactions on Information Theory

Issue 6 • November 1969

Filter Results

Displaying Results 1 - 23 of 23
  • Generation-recombination noise in solids

    Publication Year: 1969, Page(s):644 - 648
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (654 KB)

    This paper is concerned with some of the mathematical aspects of noise in solids. Attention is given to generation-recombination noise. This noise is due to current fluctuations arising from the generation, recombination, or trapping of carriers. We treat only homogeneous systems, and therefore, our descriptive random processes are independent of spatial coordinates. In our model, we associate a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characteristics of Gaussian random processes by representations in terms of independent random variables

    Publication Year: 1969, Page(s):648 - 658
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1623 KB)

    Certain isospectral classes of random processes and certain linear representations of these processes are considered. It is shown that the Gaussian member of each class is the only one having the desirable property of being representable as a linear combination of statistically independent components. For example, among all strictly stationary, band-limited, white-noise processes, only the Gaussia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-filling curves: Their generation and their application to bandwidth reduction

    Publication Year: 1969, Page(s):658 - 664
    Cited by:  Papers (64)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1054 KB)

    This paper introduces a class of finite-state algorithms which characterize self-similar space-filling curves. The curves enable one to continuously map a line onto anN-dimensional cube, and find application in compressing the bandwidth of arbitrary waveforms. The bandwidth compression is effected in return for an increased susceptibility of the signal to perturbations. The algorithms a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strictly complex impulse-equivalent codes and subsets with very uniform amplitude distributions

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

    The generation of a code of lengthN + 1with an impulse-equivalent autocorrelation leads to a class of2^{N}possible signals. Examination of the root patterns of the generating polynomials of these signals shows that many of the codes that appear to be complex have real counterparts with identical amplitude distributions. The existence of a certain subclass of complex codes wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on the weight distribution of linear codes

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

    By studying the algebraic structure of the parity check matrix of a linear code we show that the weight distribution is a function only of the quantitiesN_{upsilon}^{u}, the number ofupsiloncolumns of the parity check matrix with ranku. We apply this to obtain a new formula for the weight distribution of the distance3 s-ary Hamming code and for the dista... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Burst-trapping techniques for a compound channel

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

    An adaptive decoding technique called burst trapping is presented to correct both random and burst errors. Two decoding algorithms are used, one for random errors, and the other for bursts. The former is based on a conventional correction technique, the latter utilizes an encoding procedure for which each information digit appears twice in the data stream, first unchanged, and second combined with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on linear feature extraction [Corresp.]

    Publication Year: 1969, Page(s):728 - 730
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (485 KB)

    The problem considered is that of finding the best linear transformation to reduce a random-data vectorzto a vector of smaller dimension. It is assumed that the original data are Gaussian under either of two hypotheses, and that one wishes to use the transformed data to distinguish the hypotheses. The Bhattacharya distance is used to measure the information carried by the transformed da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Perceptrons: An Introduction to Computational Geometry' (Minsky, M., and Papert, S.; 1969)

    Publication Year: 1969, Page(s):738 - 739
    Request permission for commercial reuse | PDF file iconPDF (433 KB)
    Freely Available from IEEE
  • Review of 'Communication Theory: Transmission of Waveforms and Digital Information' (Sakrison, D. J.; 1968)

    Publication Year: 1969, Page(s): 738
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • Fredholm resolvents, Wiener-Hopf equations, and Riccati differential equations

    Publication Year: 1969, Page(s):665 - 672
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1280 KB)

    We shall show that the solution of Fredholm equations with symmetric kernels of a certain type can be reduced to the solution of a related Wiener-Hopf integral equation. A least-squares filtering problem is associated with this equation. When the kernel has a separable form, this related problem suggests that the solution can be obtained via a matrix Riccati differential equation, which may be a m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative sequential decoding

    Publication Year: 1969, Page(s):715 - 721
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    It is shown that use of a two-stage decoding procedure consisting simply of an inner stage of block decoding and an outer stage employing a single sequential decoder does not result in an improvement in the computational overflow problem for the sequential decoder. Improvement can, however, result from use of multiple sequential decoders or use of a single sequential decoder with appropriate scram... View full abstract»

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

    Publication Year: 1969, Page(s):732 - 734
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of upper bounds on probability of error for multihypotheses pattern recognition (Corresp.)

    Publication Year: 1969, Page(s):730 - 731
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A class of upper bounds on the probability of error for the general multihypotheses pattern recognition problem is obtained. In particular, an upper bound in the class is shown to be a linear functional of the pairwise Bhattacharya coefficients. Evaluation of the bounds requires knowledge of a priori probabilities and of the hypothesis-conditional probability density functions. A further bound is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On calling station codes (Corresp.)

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

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital-detection probability of fluctuating pulsed radar signals (Corresp.)

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

    This correspondence describes the digital-detection (binary integration, double threshold detection) properties for a fluctuating radar echo, assuming the Rice distribution for signal plus noise. Calculation results make clear the transition of detection properties from the nonfluctuating case to the extreme fluctuating case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of decoders--I: Classes of decoding rules

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

    Several classes of decoding rules are considered here including block decoding rules, tree decoding rules, and bounded-distance and minimum-distance decoding rules for binary parity-check codes. Under the assumption that these rules are implemented with combinational circuits and sequential machines constructed with AND gates, OR gates, INVERTERS, and binary memory cells, bounds are derived on the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on the nonbinary BCH code (Corresp.)

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

    First Page of the Article
    View full abstract»

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

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

    Some known results on the nonexistence of linear optimal codes can be very easily proved using results on the weight distribution of such codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of cluster detection to text and picture processing

    Publication Year: 1969, Page(s):672 - 681
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    Syntactic information about a corpus of linguistic or pictorial data can be discovered by analyzing the statistics of the data. Given a corpus of text, one can measure the tendencies of pairs of words to occur in common contexts, and use these measurements to define clusters of words. Applied to basic English text, this procedure yields clusters which correspond very closely to the traditional par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax CFAR detection in additive Gaussian noise of unknown covariance (Corresp.)

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

    By employing invariance theory and the Hunt-Stein theorem in particular, CFAR and minimax detectors are derived for a signal of unknown phase in the presence of additive Gaussian noise of unknown covariance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of binary cyclic burst-error-correcting codes (Corresp.)

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

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intersymbol interference and probability of error in digital systems

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

    Intersymbol interference and additive Gaussian noise are two important sources of distortion in digital systems, and a principal goal in the analysis of such systems is the determination of the resulting probability of error. Earlier related work has sought to estimate the error probability either by calculating an approximation based upon a truncated version of the random pulse train or by obtain... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Photon detection for an optical pulse code modulation system (Corresp.)

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

    A mathematical model is formulated for an optical PCM system. Using the signal-to-noise ratio at the decision circuit as the performance criterion, the optimization of a nonlinear detector is carried out. Closed-form expressions for the jointly optimum electrical filtering and biasing, and for the maximum signal-to-noise ratio are obtained. 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