By Topic

Information Theory, IEEE Transactions on

Issue 6 • Date November 1976

Filter Results

Displaying Results 1 - 25 of 27
  • Our reviewers

    Page(s): 642 - 643
    Save to Project icon | Request Permissions | PDF file iconPDF (183 KB)  
    Freely Available from IEEE
  • Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975)

    Page(s): 765 - 766
    Save to Project icon | Request Permissions | PDF file iconPDF (375 KB)  
    Freely Available from IEEE
  • 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)

    Page(s): 766 - 767
    Save to Project icon | Request Permissions | 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)

    Page(s): 767
    Save to Project icon | Request Permissions | PDF file iconPDF (179 KB)  
    Freely Available from IEEE
  • Review of 'The Origins of Feedback Control' (Mayr, O.; 1971)

    Page(s): 767 - 768
    Save to Project icon | Request Permissions | PDF file iconPDF (333 KB)  
    Freely Available from IEEE
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • On efficient majority logic decodable codes

    Page(s): 737 - 745
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1096 KB)  

    A particular shortening technique is applied to majority logic decodable codes of length2^{t}. The shortening technique yields new efficient codes of lengthsn = 2^{p}, wherepis a prime, e.g., a (128,70) code withd_{maj} = 16. For moderately long code lengths (e.g.,n = 2^{11} or 2^{13}), a 20-25 percent increase in efficiency can be achieved over the best previously known majority logic decodable codes. The new technique also yields some efficient codes for lengthsn = 2^{m}wheremis a composite number, for example, a (512,316) code withd_{maj} = 32code which has 42 more information bits than the previously most efficient majority logic decodable code. 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

    Page(s): 708 - 715
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1104 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 and quadrature coherent video signals is found to provide a given output map signal-to-noise ratio with a data rate within about 20 percent of the derived lower bound. 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.)

    Page(s): 746 - 751
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (768 KB)  

    A highly efficient method of evaluating probabilities of detection and the generalizedcal Q-function to within an absolute accuracyepsilonis presented. Many unnecessary computations are avoided when it can be determined by Chernoff bounds that the desired function is withinepsilonof 0 or 1. When this is not the case, efficient algorithms for the necessary computations are also provided. 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.)

    Page(s): 751 - 753
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (480 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 vectorXin Euclideann-dimensional space. In this paper, the problem of choosing the components ofXin such a way that the minimum distance between any two codewords is maximized is solved. In particular, a closed-form expression is obtained for this minimum distance and is used to investigate the asymptotic behavior of some selected codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New directions in cryptography

    Page(s): 644 - 654
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2176 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 communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. 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.)

    Page(s): 756 - 757
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (320 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 aD-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.)

    Page(s): 757 - 759
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (496 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.
  • Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric detection with autoregressive data

    Page(s): 725 - 731
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (880 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" is proposed as a means of restoring the distribution-free character of rank tests when operating on dependent data. Under autoregressive dependence a consistent estimator for the variance of a class of two-sample rank test statistics is developed, and it is shown that the studentized versions of these statistics are asymptotically normal with mean zero and variance one. Simulation results are presented for the rate of convergence of the studentized two-sample Wilcox0n detector when operating on first-order and second-order stationary autoregressive processes. 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

    Page(s): 716 - 724
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1128 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 in the approximation and how the errors tend to stabilize as the process evolves. Computational results on a highly idealized biological population surveillance problem are given that tend to confirm assertions concerning the relative computational efficiency and accuracy of the suboptimal rule in comparison to the optimal solution. A more realistic radar simulation study (20 targets and 10 000 states) is reported that suggests the scope of application of thc methodology proposed here. View full abstract»

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

    Page(s): 753 - 756
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (592 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.
  • Combinatorial aspects of orthogonal parity checks (Corresp.)

    Page(s): 759 - 763
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (896 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.
  • Estimation and decision for observations derived from martingales: Part I, Representations

    Page(s): 691 - 707
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2648 KB)  

    The observation processyconsidered 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 foryin terms of its innovations and following a Girsanov-type measure transformation are derived. These are then used to develop a measure form of Bayes' rule that provides a convenient tool for the study of estimation and decision problems arising in a variety of applications including communication and control. 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

    Page(s): 732 - 736
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (760 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 to predict the remainder is determined by the nonlinear feed-forward operations. The linear feedback shift registers are represented in terms of the roots of their characteristic equations in a finite field, and it is shown that nonlinear operations inject additional roots into the representation. The number of roots required to represent a generator is a measure of its complexity, and is equal to the length (number of stages) of the shortest linear feedback shift register that produces the same sequence. The analysis procedure can be applied to any arbitrary combination of binary shift register generators, and is also applicable to the synthesis of complex generators having desired properties. Although the discussion in this paper is limited to binary sequences, the analysis is easily extended to similar devices that generate sequences with members in any finite field. 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.)

    Page(s): 763 - 764
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (240 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 mapbetais considered. This problem has been solved under the restriction thatbeta = alpha^{-1}. It is shown that the same solution still obtains when this restriction is removed. 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

    Page(s): 655 - 665
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1712 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 similarly defined. The capacity region is defined to include all incoming message rates for which there exists a set of data-compression schemes yielding a prescribed network distortion-delay value. The basic characteristics of these functions and regions are derived. In particular, it is shown that their evaluations can be performed by solving separately the source coding problem and the network's queuing problem. The distortion-delay functions and regions are explicitly derived for single channel systems. 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

    Page(s): 682 - 690
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1440 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 for ergodic sources and discrete memoryless noisy channels. Combining this result with a theorem on sliding-block source coding with a fidelity criterion yields a sliding-block information transmission theorem. Thus, the basic existence theorems of information theory hold for stationary nonblock structures, as well as for block codes. 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
Frank R. Kschischang

Department of Electrical and Computer Engineering