IEEE Transactions on Information Theory

Volume 30 Issue 1 • January 1984

Filter Results

Displaying Results 1 - 23 of 23
  • Lattice filter parameterization and modeling of nonstationary processes

    Publication Year: 1984, Page(s):2 - 16
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2222 KB)

    A general theory of constant-parameter modular lattice models for discrete-time nonstationary second-order processes is presented. A complete parametrization of such processes in terms of Schur and congruence coefficients is derived by developing a natural connection between the displacement structure of a covariance matrix and Schur's test for positive-definiteness of matrices. Schur coeffieients... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified sequential detection procedure

    Publication Year: 1984, Page(s):16 - 23
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    A modified version of sequential testing is proposed and applied to discrete-time signal detection. The resulting detection procedure exhibits simplicity in structure and in analysis and retains most of the optimal features of sequential detection. Also, two Simple and efficient truncation schemes are suggested for the proposed detection procedure which is unrealizable without truncation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel

    Publication Year: 1984, Page(s):23 - 34
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1467 KB)

    Upper and lower bounds are derived on the exponential behavior of the<tex>\alpha</tex>-mean error for parameter transmission over the additive white Gaussian noise channel. The method of proving the lower bound may be used in many information theory and mathematical statistics problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general coding scheme for the two-way channel

    Publication Year: 1984, Page(s):35 - 44
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1458 KB)

    A general coding scheme for the nonrestricted memoryless discrete two-way channel is presented based on the introduction of auxiliary random variables forming a stationary Markov process. The coding scheme yields an achievable rate region which exceeds the inner bound of Shannon in the general case. A finite cardinality bound for the auxiliary random variables is given, showing that the region is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channels with block interference

    Publication Year: 1984, Page(s):44 - 53
    Cited by:  Papers (273)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1578 KB)

    A new class of channel models with memory is presented in order to study various kinds of interference phenomena. It is shown, among other things, that when all other parameters are held fixed, channel capacity<tex>C</tex>is an {\em increasing} function of the memory length, while the cutoff rate<tex>R_{0}</tex>generally is a {\em decreasing} function. Calculations with var... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block source coding theory for asymptotically mean stationary sources

    Publication Year: 1984, Page(s):54 - 68
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2288 KB)

    Several properties of operational and information theoretic distortion rate functions and of mutual information rate are developed for asymptotically mean stationary (ams) processes with standard alphabets and used to prove a block source coding theorem for ergodic ams sources. In the development we prove an ergodic decomposition of the mutual information rate of ams sources, we show that the oper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OPEC or a basic problem in source networks

    Publication Year: 1984, Page(s):68 - 77
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1354 KB)

    The problem of determining the achievable rate region for an arbitrary source network with one "helper" is still unsolved. Csisz&#225;r and the author have shown that it reduces to the one-parameter entropy characterization problem (OPEC), treated in their monograph on information theory. For a discrete memoryless multiple source, solving the OPEC problem means finding a computable characteriz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution-free consistency of a nonparametric kernel regression estimate and classification

    Publication Year: 1984, Page(s):78 - 81
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (487 KB)

    It is shown that the kernel estimate of the regression<tex>E(Y|X = x)</tex>is weakly or strongly consistent for almost all<tex>x(\mu)</tex>, where<tex>\mu</tex>is the probability measure of<tex>X</tex>. The result is valid for any distribution of<tex>X</tex>. The asymptotical optimality of classification rules derived from the estimate is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Upper Bound on the Key Equivocation for Pure Ciphers

    Publication Year: 1984, Page(s):82 - 84
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB)

    An upper bound on key equivocation for a pure cipher applied on a memoryless message source is derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Notes on the asymptotic behavior of the information rate of block codes (Corresp.)

    Publication Year: 1984, Page(s):84 - 85
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    The behavior of the signaling rate of error-correcting codes of length<tex>n</tex>and minimum distance<tex>d_{n}</tex>is studied in the limit for large<tex>n</tex>when the sequence<tex>d_{n}/n</tex>approaches a prescribed limit<tex>\delta</tex>. A function<tex>R(\delta)</tex>representating the asymptotic signaling rate is defi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new linear convex hull algorithm for simple polygons (Corresp.)

    Publication Year: 1984, Page(s):85 - 88
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    A new optimal algorithm for computing the convex hull of a simple polygon in the plane, along with a proof of correctness, is presented. The main novelty of the proposed algorithm is its use of existing concepts such as the unimodality of the area of a triangle inscribed in a convex polygon and Sldansky's scan. The combination of these concepts gives us new insight into the problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noiseless coding of binary finite-order Markov sources (Corresp.)

    Publication Year: 1984, Page(s):88 - 91
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (570 KB)

    The performance of several simple noiseless coding schemes for binary finite-order Markov sources is considered. Bounds are derived on the maximum difference between the performance achievable by the schemes and the entropy of the sources. The schemes can be modified for the case where the source statistics are unknown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost everywhere convergence of a recursive regression function estimate and classification (Corresp.)

    Publication Year: 1984, Page(s):91 - 93
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (418 KB)

    It is shown that the recursive kernel estimate of the regression function<tex>E(Y|X = x)</tex>is consistent at almost every<tex>x(\mu)</tex>regardless of the distribution<tex>\mu</tex>of<tex>X</tex>. Thus the result is distribution-free. From this we show that the risk for a suitable classification rule derived from the estimate converges to Bayes' r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision tree design using a probabilistic model (Corresp.)

    Publication Year: 1984, Page(s):93 - 99
    Cited by:  Papers (26)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1303 KB)

    A sequential optical character recognition algorithm, ideally suited for implementation by means of microprocessors with limited storage capabilities, is formulated in terms of a binary decision tree. Upper bounds On the recognition performance are derived in terms of the stability of the digitized picture elements. The design process is described in detail. The algorithm is tested on single-font ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codes (Corresp.)

    Publication Year: 1984, Page(s):100 - 104
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB)

    The distance properties of a class of rates<tex>2/3</tex>and<tex>3/4</tex>binary convolutional codes recently constructed by Paaske are reported. The data comprise the truncated input and output weight distributions of the codewords in the incorrect subset and the column distance function. which is strongly related to the computational effort of sequential decoding. The min... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variance mismatch of vector quantizers (Corresp.)

    Publication Year: 1984, Page(s):104 - 107
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (577 KB)

    The asymptotic performance of variance-mismatched vector quantizers is presented. It is demonstrated by both asymptotic analysis and computer simulations that well-designed vector quantizers are inherently more invulnerable to mismatch than are conventional scalar quantizers. A generalized exponential density function is considered as a statistical model of sources. As an example, the asymptotic p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional digitization of data followed by a mapping (Corresp.)

    Publication Year: 1984, Page(s):107 - 110
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (638 KB)

    In many applications it is necessary to digitize data, knowing only that later on some random function of the digitized data will be of interest. This problem is investigated when the data digitizers are allowed to be multidimensional, i.e., they map a<tex>K</tex>-dimensional data vector into one of a set of<tex>K</tex>-dimensional output vectors. It is shown that very comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Poor error correction codes are poor error detection codes (Corresp.)

    Publication Year: 1984, Page(s):110 - 111
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    We show that binary group codes that do not satisfy the asymptotic Varshamov-Gilbert bound have an undesirable characteristic when used as error detection codes for transmission over the binary symmetric channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast progressive reconstruction of a transformed image (Corresp.)

    Publication Year: 1984, Page(s):111 - 117
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    Fast methods for performing progressive reconstruction of Fourier and Hadamard transformed images have been developed. Reconstruction of an<tex>N \times N</tex>point transformed image can be evaluated in order<tex>N^{2} \log_{2} N</tex>instructions. Accumulation of round-off errors due to iteration is reduced by the factor<tex>(\log_{2} N + 1) / N^{2}</tex>, com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power spectral density bounds (Corresp.)

    Publication Year: 1984, Page(s):117 - 122
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1046 KB)

    The determination of a power density spectrum from a finite set of correlation samples is an ill-posed problem. Furthermore. it is not possible even to bound the values that consistent power density spectra can take on at a particular point. A more reasonable problem is to try to determine the total spectral power in some frequency interval. Although this power cannot be determined exactly, upper ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power spectrum of FM clicks (Corresp.)

    Publication Year: 1984, Page(s):122 - 124
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB)

    For the case of an unmodulated carrier, a simple approximate result is developed for the power spectral density of frequency-modulated (FM) clicks at the output of an ideal FM discriminator. In the baseband region the result agrees well with known exact results obtained by numerical integration at the threshold carrier-to-noise power ratio of<tex>10</tex>. Simple results are also prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the invariant measures of some discrete-time Markov processes (Corresp.)

    Publication Year: 1984, Page(s):125 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (283 KB)

    Expressions for the moments of invariant measures corresponding to a class of discrete-time Markov processes are given. The processes under consideration assume values in<tex>R^{+}</tex>and have stationary transition kernels of exponential type, generalizing the Rayleigh and gamma distributions. The moments of their stationary distributions, obtained by extending a method due to Wold, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A remark on radar ambiguity functions (Corresp.)

    Publication Year: 1984, Page(s):126 - 127
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB)

    The ambiguity function of a signal<tex>f(t)</tex>determines<tex>f</tex>up to a constant. Here we explore the extent to which<tex>f</tex>can be modified without affecting the modulus of its ambiguity function. 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu