IEEE Transactions on Information Theory

Volume 28 Issue 5 • September 1982

Filter Results

Displaying Results 1 - 25 of 26
  • In Memorium: Jacob Wolfowitz

    Publication Year: 1982, Page(s):687 - 690
    Request permission for reuse | PDF file iconPDF (575 KB)
    Freely Available from IEEE
  • Information of partitions with applications to random access communications

    Publication Year: 1982, Page(s):691 - 701
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1739 KB)

    The minimum amount of information and the asymptotic minimum amount of entropy of a random partition which separates the points of a Poisson point process are found. Related information theoretic bounds are applied to yield an upper bound to the throughput of a random access broadcast channel. It is shown that more information is needed to separate points by partitions consisting of intervals than... View full abstract»

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

    Publication Year: 1982, Page(s):701 - 713
    Cited by:  Papers (84)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1958 KB)

    Causal source codes are defined. These include quantizers, delta modulators, differential pulse code modulators, and adaptive versions of these. Several types of causal codes are identified. For memoryless sources it is shown that the optimum performance attainable by causal codes can be achieved by memoryless codes or by time-sharing memoryless codes. This optimal performance can be evaluated str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A conference key distribution system

    Publication Year: 1982, Page(s):714 - 720
    Cited by:  Papers (242)  |  Patents (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (934 KB)

    Encryption is used in a communication system to safeguard information in the transmitted messages from anyone other than the intended receiver(s). To perform the encryption and decryption the transmitter and receiver(s) ought to have matching encryption and decryption keys. A clever way to generate these keys is to use the public key distribution system invented by Diffie and Hellman. That system,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical discrimination using inaccurate models

    Publication Year: 1982, Page(s):720 - 728
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1343 KB)

    The performance of a multiclass maximum likelihood decision rule is analyzed, when inaccurate versions of the true probability density functions are used. A general bound to the error probability is developed, and it is valid for both finite observation size<tex>n</tex>and<tex>n \rightarrow \infty</tex>. A necessary and sufficient condition is developed for the bound to be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood estimation for multivariate observations of Markov sources

    Publication Year: 1982, Page(s):729 - 734
    Cited by:  Papers (218)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (727 KB)

    Parameter estimation for multivariate functions of Markov chains, a class of versatile statistical models for vector random processes, is discussed. The model regards an ordered sequence of vectors as noisy multivariate observations of a Markov chain. Mixture distributions are a special case. The foundations of the theory presented here were established by Baum, Petrie, Soules, and Weiss. A powerf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal detection in the presence of weakly dependent noise--I: Optimum detection

    Publication Year: 1982, Page(s):735 - 744
    Cited by:  Papers (8)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1645 KB)

    The problem of discrete-time signal detection in the presence of additive noise exhibiting a weak form of dependence is considered. A moving-average representation is used to model dependence in the noise sequence, and the degree of dependence is parameterized by the averaging weights. The weak-dependence model is then based on the situation in which terms depending to second or higher Order on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal detection in the presence of weakly dependent noise--II: Robust detection

    Publication Year: 1982, Page(s):744 - 752
    Cited by:  Papers (41)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1536 KB)

    The problem of designing robust systems for detecting constant signals in the presence of weakly dependent noise with uncertain statistics is considered. As in Part I of this study, which treated optimum detection in weakly dependent noise, a moving-average representation is used to model the dependence structure of the noise process, with the degree of dependence being parameterized by the averag... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Square root Kalman filtering for high-speed data received over fading dispersive HF channels

    Publication Year: 1982, Page(s):753 - 763
    Cited by:  Papers (78)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    This paper shows how to apply square root Kalman filtering to high speed data transmission on fading dispersive high-frequency (HF) channels. High data-rate HF transmission can be achieved by use of a single carrier bandwidth efficiency modulation that is demodulated with decision-feedback equalization (DFE). The DFE coefficients are updated adaptively by square root Kalman algorithms. Theoretical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comma free error correcting codes of variable length, generated by finite-state encoders

    Publication Year: 1982, Page(s):764 - 775
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1907 KB)

    A finite-state code (FSC) is the set of output sequences of a finite-state encoder. The case is considered where the period of the eneoder is one and the code is used as an error-correcting code. In this context the Levenshtein distance will measure the discrepancy between an information sequence and its estimate, and the minimum Hamming distance will be taken as the criterion of efficiency. The c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized T-user codes for multiple-access channels (Corresp.)

    Publication Year: 1982, Page(s):775 - 778
    Cited by:  Papers (22)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    Large classes of<tex>T</tex>-user codes for the binary adder channel are shown to be easily constructed by generalizing some previous results in two basic ways. The first is an iterative procedure; the second is by introducing an equivalence relation on such codes. Decoding algorithms are presented in both cases. The number of codes in the equivalence class of some previously defined c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concatenated codes for the Lee metric (Corresp.)

    Publication Year: 1982, Page(s):778 - 779
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (275 KB)

    It is noted that the Justesen construction produces codes with fairly good Lee distance properties. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New decoding algorithm for Reed - Muller codes (Corresp.)

    Publication Year: 1982, Page(s):779 - 787
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1134 KB)

    We interpret Reed-Muller codes in terms of superimposition and present a new decoding algorithm for Reed-Muller codes. Before presenting this algorithm, we propose a decoding algorithm for a class of simple iterated codes (SI codes) that will play an important role in our new decoding algorithm. Finally, we compare our algorithm with the conventional algorithm for the cyclic Reed-Muller codes from... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction for binary asymmetric error-correcting codes (Corresp.)

    Publication Year: 1982, Page(s):787 - 789
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (461 KB)

    A construction method of asymmetric error-correcting codes is proposed. In this method, a<tex>t</tex>-fold asymmetric error-correcting code of length<tex>n-1</tex>is constructed by expurgating and puncturing any<tex>t</tex>-fold symmetric error-correcting code of length<tex>n</tex>. These codes are designed for use on binary asymmetric channels, such... View full abstract»

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

    Publication Year: 1982, Page(s):789 - 790
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    The rank of the generating matrix in certain cases is computed. The result is perhaps of interest in its own right, apart from any applications it may have. The method of proof, utilizing as it does a knowledge of the parameters of a certain association scheme, is a technique which can be profitably used elsewhere. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized minimum distance decoding on majority logic decodable codes (Corresp.)

    Publication Year: 1982, Page(s):790 - 792
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (479 KB)

    Generalized minimum distance decoding schemes are found for majority logic decodable codes. These decoding schemes are parallel to the classical majority logic decoding schemes and thus can be easily implemented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formulas for the solutions of quadratic equations overGF(2^m)(Corresp.)

    Publication Year: 1982, Page(s):792 - 794
    Cited by:  Papers (16)  |  Patents (54)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    There are several known approaches to solving quadratic equations over GF(2^{m}). Here the approach to solving the equations is different from the known approaches in that the solutions are presented in terms of the parameters of the equations. The formulas for solving the quadratic equations are also used to solve the equations of degrees three and four. The results can be combined wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New short constraint length convolutional code constructions for selected rational rates (Corresp.)

    Publication Year: 1982, Page(s):794 - 800
    Cited by:  Papers (76)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    New short constraint length convolutional code constructions are tabulated for rates<tex>R=(n-k)/n, k=1,2, \cdots ,n-1</tex>with<tex>n=2, 3,\cdots ,8</tex>, and for constraint lengths<tex>K=3,4, \cdots,8</tex>. These codes have been determined by iterative search based upon a criterion of optimizing the free distance profile. Specifically, these codes maximize t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple general binary source code (Corresp.)

    Publication Year: 1982, Page(s):800 - 803
    Cited by:  Papers (52)  |  Patents (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    A source code for binary strings, admitting a simple and fast hardware implementation, is described. The code is an arithmetic code, and it is capable of encoding strings modeled by stationary or nonstationary sources alike without use of alphabet extension. In particular, in the case with a stationary independent information source, the code degenerates to a bitwise implementation of Golomb's run... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wyner - Ziv theory for a general function of the correlated sources (Corresp.)

    Publication Year: 1982, Page(s):803 - 807
    Cited by:  Papers (46)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (701 KB)

    A source coding problem is considered for the Wyner-Ziv type system where the decoder is required to estimate the value of some function of the encoder input and the side information. The rate-distortion function is established for this system, and for some binary cases parametric expressions are obtained to enable numerical calculations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-limited sampling theorems for band-limited signals (Corresp.)

    Publication Year: 1982, Page(s):807 - 809
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (534 KB)

    A procedure is given for the recovery of a band-limited signal from any set of samples by which it is uniquely determined. Containing, as a special case, Shannon's sampling theorem, it applies even to situations, such as time-limited sampling, for which no sampling basis exists, and extends to those eases the essential features of the Shannon representation needed for approximation from finite dat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sampling approximation of continuous functions with multidimensional domain (Corresp.)

    Publication Year: 1982, Page(s):809 - 814
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (934 KB)

    After evaluating Shannon's sampling theorem for functions of several variables, the aliasing error is estimated in dependence upon smoothness conditions. As a main tool the concept of multidimensional convolution integrals is introduced, in particular those of de La Vall&#233;e Poussin, which are also helpful in constructing generalized sampling series having better aliasing bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on complex sequences with low correlations (Corresp.)

    Publication Year: 1982, Page(s):814 - 816
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    A construction technique is given for complex sequences, each component of magnitude unity, with Iow autocorrelation and cross correlation. The construction is based on an application of the Carlitz-Uchiyama theorem to cyclic equivalence classes of maximal period of Reed-Solomon codes over GF<tex>(p),p</tex>being an odd prime. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The joint estimation of differential delay, Doppler, and phase (Corresp.)

    Publication Year: 1982, Page(s):817 - 820
    Cited by:  Papers (38)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (510 KB)

    In radio and sonar applications it sometimes happens that narrow-band signals, originated from a remote source and observed at a pair of receivers, differ by unknown differential phase and Doppler shift in addition to the differential delay corresponding to the range difference. The correspondence presents the joint maximum likelihood (ML) estimate of the differential delay, Doppler, and phase and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extraction of the Gaussian message from non- Gaussian signals using a time-varying filter (D.Sc. Thesis abstr. in Portuguese)

    Publication Year: 1982, Page(s): 821
    Request permission for reuse | PDF file iconPDF (114 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