IEEE Transactions on Information Theory

Volume 29 Issue 5 • September 1983

Filter Results

Displaying Results 1 - 24 of 24
  • Bounds on distances and error exponents of unit memory codes

    Publication Year: 1983, Page(s):637 - 649
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1742 KB)

    Binary unit memory codes, originally introduced by Lee, are investigated. A few examples of constant unit memory codes are given and bounds on the distance profile and the free distances are discussed. For time-varying codes asymptotic lower bounds on the distance profile and the free distance are given. The error probability for the codes, used on a memoryless binary-input, output-symmetric chann... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree encoding of stationary ergodic sources with a fidelity criterion

    Publication Year: 1983, Page(s):650 - 656
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    Tree source coding theorems with a single letter fidelity criterion are proved for stationary ergodic sources using tree codes with a fixed branch length. The higher-than-exponential convergence of distortions is shown for binary symmetric sources and Hamming distortion measure when an excess in rate is allowed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A universal data compression system

    Publication Year: 1983, Page(s):656 - 664
    Cited by:  Papers (279)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1646 KB)

    A universal data compression algorithm is described which is capable of compressing long strings generated by a "finitely generated" source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalization of Markov sources to random fields. Moreover, the algorithm does not require a working storage much larger than that needed to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple class of asymptotically optimal quantizers

    Publication Year: 1983, Page(s):664 - 676
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1606 KB)

    A simple class of quantizers is introduced which are asymptotically optimal, as the number of quantization levels increases to infinity, with respect to a mean<tex>r</tex>th power absolute error distortion measure. These asymptotically optimal quantizers are very easy to compute. Their performance is evaluated for several distributions and compares favorably with the performance of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust matched filters

    Publication Year: 1983, Page(s):677 - 687
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1709 KB)

    The problem of designing robust matched filters for situations in which there is uncertainty in the signal structure or noise statistics is considered. Two general aspects of this problem are treated. First, maximin robust designs are characterized for a general Hilbert-space formulation of the matched filtering problem and explicit solutions are given for two intuitively appealing models for unce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical inference with partial prior information

    Publication Year: 1983, Page(s):688 - 695
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1258 KB)

    Statistical inference procedures are considered when less complete prior information is available than usually considered. For the purposes of this paper, the prior information is taken to be the specification of a set of probability measures<tex>\cal P</tex>. With any one prior probability measure the corresponding Bayes' estimate may be found; the recommended inference procedure when... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probability density estimation from sampled data

    Publication Year: 1983, Page(s):696 - 709
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1895 KB)

    For broad classes of deterministic and random sampling schemes\{t_{k}\}we establish the consistency and asymptotic expressions for the bias and covariance of discrete-time estimatesf╠é_{n}(x)for the marginal probability density functionf(x)of continuous-time processesX(t). The effect of the sampling scheme and the sampling rate on the performance of the e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential detection of abrupt changes in spectral characteristics of digital signals

    Publication Year: 1983, Page(s):709 - 724
    Cited by:  Papers (62)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1991 KB)

    The problem of sequential detection of abrupt changes in the spectral behavior of a digital signal is addressed. This problem arises, for example, in the sequential segmentation of nonstationary digital signals such as speech, (EEG) electroencepholograms, (ECG) electrocardiogram, and geophysical signals. The limitations of a classical test will be emphasized, and some new algorithms will be presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Voronoi diagrams

    Publication Year: 1983, Page(s):724 - 731
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    A new dynamizing technique is introduced whereby<tex>n</tex>point Voronoi diagrams (both closest and farthest point) can be updated in<tex>O(n)</tex>time per insertion or deletion, in the worst case. General properties of these dynamic Voronoi diagrams are explored including a storage/ deletion-time trade-off. In addition, their application to such problems as nearest neigh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of computer memory with defects

    Publication Year: 1983, Page(s):731 - 739
    Cited by:  Papers (205)  |  Patents (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1182 KB)

    A computer memory with defects is modeled as a discrete memoryless channel with states that are statistically determined. The storage capacity is found when complete defect information is given to the encoder or to the decoder, and when the defect information is given completely to the decoder but only partially to the encoder. Achievable storage rates are established when partial defect informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding by local optimization (Corresp.)

    Publication Year: 1983, Page(s):740 - 743
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The maximum likelihood decoding problem for linear binary<tex>(n,k)</tex>codes is reformulated as a continuous optimization problem in a<tex>k</tex>-dimensional solid cube. We obtain a near optimum solution of this problem by use of a simple gradient local optimization algorithm. Computer simulation results are presented for the<tex>(21,11)</tex>projective geome... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)

    Publication Year: 1983, Page(s):743 - 748
    Cited by:  Papers (26)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (770 KB)

    Correlation decoding is an optimal scheme of soft-decision decoding for error-correcting codes in the sense of minimum block-error probability. However, it is very difficult to apply the scheme when the number of information digits is large because of decoding complexity. A new algorithm for soft-decision decoding is presented, simplifying the correlation scheme by selecting certain codewords and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A permutation decoding of the (24, 12, 8) Golay code (Corresp.)

    Publication Year: 1983, Page(s):748 - 750
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (473 KB)

    We give a minimal set consisting of<tex>14</tex>permutations to decode the<tex>(24,12,8)</tex>Golay code using a permutation decoding method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some periodic convolutional codes better than any fixed code (Corresp.)

    Publication Year: 1983, Page(s):750 - 751
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB)

    Some<tex>(n_{o}=2; k_{o}=1)</tex>noncatastrophic periodic convolutional codes with memory<tex>M=4</tex>are given that have the same free distance,<tex>d_{\infty}</tex>, as the best fixed code but have both a smaller number of paths of weight<tex>d_{\infty}</tex>per time instant and a smaller average number of information bit errors per such path for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)

    Publication Year: 1983, Page(s):751 - 754
    Cited by:  Papers (47)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (702 KB)

    Many modulation systems used in magnetic and optical recording are based on binary run-length-limited codes. We generalize the concept of<tex>dk</tex>-limited sequences of length n introduced by Tang and Bald by imposing constraints on the maximum number of consecutive zeros at the beginning and the end of the sequences. It is shown that the encoding and decoding procedures are similar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the source matching approach for Markov sources (Corresp.)

    Publication Year: 1983, Page(s):754 - 755
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB)

    The source matching approach is a universal noiseless source coding scheme used to approximate the solution of minimax coding. A numeric solution of the source matching approach is presented for the class of binary first-order Markov sources. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probability distributions of randomly moving objects on a plane (Corresp.)

    Publication Year: 1983, Page(s):756 - 761
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    An object is moving on a piecewise linear random path with a constant speed. Given the initial location and direction, the probability distribution of the object's location is calculated as a function of time, and the result is presented graphically. Then the probability of detecting such an object is calculated by using circular and line sensors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection in a Rice environment (Corresp.)

    Publication Year: 1983, Page(s):761 - 764
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Starting from a mixture of Gamma densities, the Rice density is set into an estimator-correlator structure which induces a family of suboptimal detectors exhibiting better performance than the square-law envelope detector for varying noise statistics within the Rice family. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formulas which approximate the distribution of a sinusoid plus noise (Corresp.)

    Publication Year: 1983, Page(s):765 - 767
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB)

    The exact probability density function and cumulative distribution function of a sinusoid plus noise cannot in general be expressed in closed form. In this correspondence an approximation formula is derived that is applicable to any noise distribution since it is expressed solely in terms of the noise distribution itself. Its accuracy is checked against the Gaussian and Cauchy noise models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for computing the rate and the correlation of phase slips in tuned phase tracking systems of arbitrary order (Corresp.)

    Publication Year: 1983, Page(s):768 - 770
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (482 KB)

    The steady-state slipping rate is compared with the asymptotic spread of the unreduced phase error. From this comparison one can either obtain a suitable measure for the Correlation effects or, if the correlation is known to be weak, a simplified evaluation of the slipping rate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On compound state and mutual information in quantum information theory (Corresp.)

    Publication Year: 1983, Page(s):770 - 774
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (977 KB)

    A quantum mechanical compound state of an input state and its output state generated through a communication channel is constructed. The mutual information of quantum communication theory is defined by using the compound state, and its fundamental properties are studied. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of interconnected ring communication systems with unique loop-free routing (Corresp.)

    Publication Year: 1983, Page(s):774 - 778
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (775 KB)

    {\em Capacity} is defined for a given distribution of offered traffic as the maximum rate with which packets can be sent with finite delay through the network by appropriate routing. It is shown how capacity depends on the traffic characteristics and on the topology of ring communication systems interconnected so as to provide unique loop-free routing. First, the traffic conditions are given under... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to 'A simple general binary source code' (Sep 82 800-803)

    Publication Year: 1983, Page(s):778 - 779
    Request permission for commercial reuse | PDF file iconPDF (329 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of 'Progress in Pattern Recognition' (Kanal, L.N., and Rosenfeld, A., Eds.; 1981)

    Publication Year: 1983, Page(s):779 - 780
    Request permission for commercial reuse | PDF file iconPDF (387 KB)
    Freely Available from IEEE

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