IEEE Transactions on Information Theory

Issue 3 • May 1985

Filter Results

Displaying Results 1 - 17 of 17
  • Covering radius---Survey and recent results

    Publication Year: 1985, Page(s):328 - 343
    Cited by:  Papers (129)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1903 KB)

    All known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other aspects of coding theory through the Reed-Muller codes, and new results on the least covering radius of any linear[n,k]code. There is also a recent r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On universal quantization

    Publication Year: 1985, Page(s):344 - 347
    Cited by:  Papers (97)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    The quantization ofn-dimensional vectors inR^{n}with an arbitrary probability measure, under a mean-square error constraint, is discussed. It is demonstrated that a uniform, one-dimensional quantizer followed by a noiseless digital variable-rate encoder ("entropy encoding") can yield a rate that is, for anyn, no more than0.754bit-per-sample higher than t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large deviations, hypotheses testing, and source coding for finite Markov chains

    Publication Year: 1985, Page(s):360 - 365
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (665 KB)

    Let{X_{n}} n geq 1be a finite Markov chain with transition probability matrix of strictly positive entries. A large deviation theorem is proved for the empirical transition count matrix and is used to get asymptotically optimal critical regions for testing simple hypotheses about the transition matrix. As a corollary, the error exponent in the source coding theorem for{X_{n}}... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm

    Publication Year: 1985, Page(s):378 - 384
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1037 KB)

    Minimum distance decoding (MDD) for a general error-correcting linear code is a hard computational problem that recently has been shown to beNP-hard. The complexity of known decoding algorithms is determined bymin (2^{k},2^{n-k}), wherenis the code length andkis the number of information digits. Two new algorithms are suggested that reduce substantially ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the covering radius of codes

    Publication Year: 1985, Page(s):385 - 401
    Cited by:  Papers (104)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1856 KB)

    The covering radiusRof a code is the maximal distance of any vector from the code. This work gives a number of new results concerningt[n, k], the minimal covering radius of any binary code of lengthnand dimensionk. For examplet[n, 4]andt[n, 5]are determined exactly, and reasonably tight bounds ont[n, k]are obtained for an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The covering radius of cyclic codes of length up to 31 (Corresp.)

    Publication Year: 1985, Page(s):446 - 447
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB)

    The covering radius is given for all binary cyclic codes of length less than or equal to31. Many of these codes are optimal in the sense of having the smallest possible covering radius of any linear code of that length and dimension. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-distortion performance of DPCM schemes for autoregressive sources

    Publication Year: 1985, Page(s):402 - 418
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2448 KB)

    An analysis of the rate-distortion performance of differential pulse code modulation (DPCM) schemes operating on discrete-time auto-regressive processes is presented. The approach uses an iterative algorithm for the design of the predictive quantizer subject to an entropy constraint on the output sequence. At each stage the iterative algorithm optimizes the quantizer structure, given the probabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive limited memory filtering and scattering theory (Corresp.)

    Publication Year: 1985, Page(s):440 - 443
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Redheffer scattering theory is reviewed in a generalized setting as a method to derive recursive solutions of linear two-point boundary value problems (TPBVP) over arbitrarily varying intervals. The results can be used to derive a complete solution for the problem of limited-memory (or sliding-window) estimation, when a usual state-space model for the signal is available. Recursive limited-memory ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the detectability of weak signals (Corresp.)

    Publication Year: 1985, Page(s):433 - 436
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    Approximate performance results are obtained for optimal detection of weak discrete time signals. The analysis parallels the "locally optimum" approach for detector design and is based on a small-signal Taylor series approximation to the Chernoff error probability bounds. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variance estimation and adaptive quantization (Corresp.)

    Publication Year: 1985, Page(s):428 - 433
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    The relationship between variance estimation and adaptive quantization is investigated for memoryless Laplacian and Gaussian sources. Comparison of block average, exponential average, and maximum likelihood estimators in an adaptive quantization scheme indicates that estimator precision (variance) is more important than accuracy (bias) in minimizing distortion. Further, the block average and expon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sofic systems and encoding data

    Publication Year: 1985, Page(s):366 - 377
    Cited by:  Papers (51)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1856 KB)

    Techniques of symbolic dynamics are applied to prove the existence of codes suitable for certain input-restricted channels. This generalizes the earlier work of Adler, Coppersmith, and Hassner on the same problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An iterative code construction for the broadcast channel with degraded message sets (Corresp.)

    Publication Year: 1985, Page(s):422 - 428
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    Ahlswede and Dueck introduced an iterative method for constructing codes for the discrete memoryless channel that meet the random coding bound. Their codes are constructed by making a relatively few permutations of a single codeword. In this correspondence their idea is extended to the broadcast channel with degraded message sets. The codes constructed here have average error probabilities below t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The discrete memoryless multiple-access channel with cribbing encoders

    Publication Year: 1985, Page(s):313 - 327
    Cited by:  Papers (124)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1872 KB)

    The capacity regions are determined for various communication situations in which one or both encoders for a multiple access channel crib from the other encoder and learn the channel input(s) (to be) emitted by this encoder. Most of the achievability proofs in this paper hinge upon the new concept of backward decoding. Also, the notion of Shannon strategies seems to be of crucial importance. It is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary codes for compound channels (Corresp.)

    Publication Year: 1985, Page(s):436 - 440
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    The error correcting capabilities are studied of some binary codes used on channels where both independent and burst errors may occur. The compound distance profile is introduced, and a lower bound on this profile is obtained for a class of modified maximum distance separable codes. Several constructions are presented as an illustration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes for the asymmetric broadcast channel, generated by permutations (Corresp.)

    Publication Year: 1985, Page(s):419 - 422
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    An iterative technique is studied for constructing codes for the asymmetric broadcast channel which achieve the exponential error bound of Körner and Sgarro. The codes are generated by a sequence of relatively few (i.e., linear in blocklength) permutations. This technique generalizes and extends earlier results of Ahlswede and Dueck and of the author. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing (Corresp.)

    Publication Year: 1985, Page(s):444 - 446
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    In the estimation problem of a two-state stationary Markov process with Gaussian white noise added, the optimal smoother is a two-filter smoother. In a special case, the performance of the optimal nonlinear filter and smoother is evaluated analytically. Some asymptotic results are also derived. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-state vector quantization for waveform coding

    Publication Year: 1985, Page(s):348 - 359
    Cited by:  Papers (199)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2104 KB)

    A finite-state vector quantizer is a finite-state machine used for data compression: Each successive source vector is encoded into a codeword using a minimum distortion rule, and into a code book, depending on the encoder state. The current state and the selected codeword then determine the next encoder state. A finite-state vector quantizer is capable of making better use of the memory in a sourc... 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
Prakash Narayan 

Department of Electrical and Computer Engineering