IEEE Transactions on Information Theory

Volume 22 Issue 6 • November 1976

Filter Results

Displaying Results 1 - 25 of 27
  • Our reviewers

    Publication Year: 1976, Page(s):642 - 643
    Request permission for commercial reuse | PDF file iconPDF (183 KB)
    Freely Available from IEEE
  • New directions in cryptography

    Publication Year: 1976, Page(s):644 - 654
    Cited by:  Papers (4422)  |  Patents (345)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2164 KB)

    Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data compression for communication networks: The delay-distortion function

    Publication Year: 1976, Page(s):655 - 665
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1701 KB)

    The problem of data compression for communication networks is considered. The system performance criterion is the signal distortion resulting both from data compression and from average message delay through the network. The delay-distortion function is defined as the smallest message delay among all data-compression schemes that yield the given distortion value. The distortion-delay region is sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of random coding exponent functions

    Publication Year: 1976, Page(s):665 - 671
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (843 KB)

    Gallager's exponent function<tex>E_{\circ}, (\rho,p)</tex>plays a crucial role in the derivation of bounds for coding error probabilities. An iterative algorithm for computing the maximum of<tex>E_{\circ} (\rho,p)</tex>over the set of input probability distributions is presented. The algorithm is similar to that of Arimoto and Blahut for computing channel capacity. It is sh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree coding of discrete-time abstract alphabet stationary block-ergodic sources with a fidelity criterion

    Publication Year: 1976, Page(s):671 - 681
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1821 KB)

    A tree coding theorem is established for discrete-time abstract alphabet stationary block-ergodic sources under a single-letter fidelity criterion. The proof of this theorem uses recent results from the theory of branching processes with random environments. The relation to previous work in tree coding is also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sliding-block joint source/noisy-channel coding theorems

    Publication Year: 1976, Page(s):682 - 690
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1424 KB)

    Sliding-block codes are nonblock coding structures consisting of discrete-time time-invariant possibly nonlinear filters. They are equivalent to time-invariant trellis codes. The coupling of Forney's rigorization of Shannon's random-coding/typical-sequence approach to block coding theorems with the strong Rohlin-Kakutani Theorem of ergodic theory is used to obtain a sliding-block coding theorem fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation and decision for observations derived from martingales: Part I, Representations

    Publication Year: 1976, Page(s):691 - 707
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2635 KB)

    The observation process<tex>y</tex>considered is an additive composition of continuous and discontinuous components. The additive Gaussian, point, and jump process models, treated separately in the past, are all included here simultaneously. Representations for<tex>y</tex>in terms of its innovations and following a Girsanov-type measure transformation are derived. These are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the date rate for synthetic aperture radar

    Publication Year: 1976, Page(s):708 - 715
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    The source coding theory of information theory is applied to the digital processing of synthetic aperture radar signals. A lower bound is established on the data rate that must exist at any point in the processing flow, in particular at the conversion from analog-to-digital (A/D) signals, to achieve a given output map signal-to-noise ratio. The usual linear uniform-step A/D conversion of in-phase ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surveillance of several Markov targets

    Publication Year: 1976, Page(s):716 - 724
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1116 KB)

    An approximation to the existing optimal algorithm for simultaneously tracking several moving targets is proposed which greatly reduces the required memory and number of calculations, but nevertheless retains reasonable accuracy (as is shown by analytic consideration and by Monte Carlo simulations) when the number of states is much greater than the number of targets. It is shown where errors arise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric detection with autoregressive data

    Publication Year: 1976, Page(s):725 - 731
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The effects of autoregressive dependence on nonparametric detection are studied. An approximation technique is used to prove the asymptotic normality of a class of two-sample rank test statistics operating on stationary autoregressive processes. The effect of second-order autoregressive dependence on the asymptotic relative efficiency of the Mann-Whitney detector is illustrated. "Studentization" i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis of the structure and complexity of nonlinear binary sequence generators

    Publication Year: 1976, Page(s):732 - 736
    Cited by:  Papers (109)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (747 KB)

    A method of analysis is presented for the class of binary sequence generators employing linear feedback shift registers with nonlinear feed-forward operations. This class is of special interest because the generators are capable of producing very long "unpredictable" sequences. The period of the sequence is determined by the linear feedback connections, and the portion of the total period needed t... View full abstract»

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

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

    A particular shortening technique is applied to majority logic decodable codes of length<tex>2^{t}</tex>. The shortening technique yields new efficient codes of lengths<tex>n = 2^{p}</tex>, where<tex>p</tex>is a prime, e.g., a (128,70) code with<tex>d_{maj} = 16</tex>. For moderately long code lengths (e.g.,<tex>n = 2^{11} or 2^{13})</tex>... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient evaluation of probabilities of detection and the generalized Q-function (Corresp.)

    Publication Year: 1976, Page(s):746 - 751
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (753 KB)

    A highly efficient method of evaluating probabilities of detection and the generalized<tex>\cal Q</tex>-function to within an absolute accuracy<tex>\epsilon</tex>is presented. Many unnecessary computations are avoided when it can be determined by Chernoff bounds that the desired function is within<tex>\epsilon</tex>of 0 or 1. When this is not the case, efficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum permutation modulation codes and their asymptotic performance (Corresp.)

    Publication Year: 1976, Page(s):751 - 753
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB)

    Permutation modulation codes are a class of group codes for the Gaussian channel whose codewords are obtained by permuting the components of a given initial vector<tex>X</tex>in Euclidean<tex>n</tex>-dimensional space. In this paper, the problem of choosing the components of<tex>X</tex>in such a way that the minimum distance between any two codewords is maximize... View full abstract»

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

    Publication Year: 1976, Page(s):753 - 756
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB)

    A strategy is given for cooperative bidding by the players which results in the location of all 52 cards being encoded into a valid bridge auction which always terminates with a contract of six diamonds. Strategies are also given for encoding the card locations into auctions in which "double" and/or "redouble" are prohibited bids. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An enumeration scheme for bidding sequences in bridge (Corresp.)

    Publication Year: 1976, Page(s):756 - 757
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB)

    A new scheme for enumerating the legal bidding sequences in bridge is developed for various constraints on the allowed bids. It is shown that such bidding sequences can be represented by fixed length strings from a<tex>D</tex>-ary alphabet and that all such strings represent bidding sequences. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Majority decoding the nonorthogonal parity checks (Corresp.)

    Publication Year: 1976, Page(s):757 - 759
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB)

    A new bound on the error-correcting capability of majority decoding using nonorthogonal parity checks is derived. The new bound is then applied to a class of Euclidean geometry codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial aspects of orthogonal parity checks (Corresp.)

    Publication Year: 1976, Page(s):759 - 763
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (884 KB)

    The notion of supplementary difference sets is used to construct codes which are one-step majority logic decodable using orthogonal parity checks. An infinite family of single and double error-correcting codes is constructed. Strong evidence is given which suggests that there exists an analogous infinite family of triple error-correcting codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On encoding and decoding maps for group codes (Corresp.)

    Publication Year: 1976, Page(s):763 - 764
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    The problem of minimizing mean-square error when digital data is encoded into the elements of a group code via an encoding map a and the received elements of the group code are decoded via a decoding map<tex>\beta</tex>is considered. This problem has been solved under the restriction that<tex>\beta = \alpha^{-1}</tex>. It is shown that the same solution still obtains when t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975)

    Publication Year: 1976, Page(s):765 - 766
    Request permission for commercial reuse | PDF file iconPDF (375 KB)
    Freely Available from IEEE
  • Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes'

    Publication Year: 1976, Page(s): 765
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Graph Theory, Coding Theory and Block Designs' (Cameron, P. J., and van Lint, J. H.; 1975)

    Publication Year: 1976, Page(s):766 - 767
    Request permission for commercial reuse | PDF file iconPDF (417 KB)
    Freely Available from IEEE
  • Review of 'System Theory, A Unified State-Space Approach to Continuous and Discrete Systems' (Padulo, L., and Arbib, M. A.; 1974)

    Publication Year: 1976, Page(s): 767
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • Review of 'The Origins of Feedback Control' (Mayr, O.; 1971)

    Publication Year: 1976, Page(s):767 - 768
    Request permission for commercial reuse | PDF file iconPDF (333 KB)
    Freely Available from IEEE
  • Fast sequential decoding and a new complete decoding algorithm (Ph.D. Thesis abstr.)

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