IEEE Transactions on Information Theory

Issue 2 • Mar 1998

Filter Results

Displaying Results 1 - 25 of 47
  • Critical distortion of Potts model

    Publication Year: 1998, Page(s):896 - 899
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The critical distortion dc of the Potts models on a number of lattices is shown to be related to the radius of convergence R of Mayer's series by dc=(q-1)R/(1+R). By using the matrix representation of Mayer's series, a recursive approach is applied to estimate R, and hence dc for Ising models for which q=2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decompositions and extremal type II codes over Z4

    Publication Year: 1998, Page(s):800 - 809
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    In previous work by Huffman and by Yorgov (1983), a decomposition theory of self-dual linear codes C over a finite field Fq was given when C has a permutation automorphism of prime order r relatively prime to q. We extend these results to linear codes over the Galois ring Z4 and apply the theory to Z4-codes of length 24. In particular we obtain 42... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypothesis testing for arbitrarily varying source with exponential-type constraint

    Publication Year: 1998, Page(s):892 - 895
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    Hypothesis testing for an arbitrarily varying source (AVS) is considered. We determine the best asymptotic exponent of the probability of error of the second kind when the first kind error probability is less than 2-nr. This result generalizes the well-known theorem of Hoeffding (1965), Blahut (1974), Csiszar and Longo (1971) for hypothesis testing with an exponential-type constraint. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Reed-Muller code R(r,m) is not Z4-linear for 3⩽r⩽m-2

    Publication Year: 1998, Page(s):798 - 799
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    After a discussion of automorphisms of Reed-Muller codes the authors show that the Reed-Muller code R(r,m) is not Z4 -linear for 3⩽r⩽m-2, proving a conjecture by Hammons, Kumar, Calderbank, Sloane, and Sole (1994) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limits to consistent on-line forecasting for ergodic time series

    Publication Year: 1998, Page(s):886 - 892
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    This article concerns problems of time-series forecasting under the weakest of assumptions. Related results are surveyed and are points of departure for the developments here, some of which are new and others are new derivations of previous findings. The contributions in this study are all negative, showing that various plausible prediction problems are unsolvable, or in other cases, are not solva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The context-tree weighting method: extensions

    Publication Year: 1998, Page(s):792 - 798
    Cited by:  Papers (51)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    First we modify the basic (binary) context-tree weighting method such that the past symbols x1-D, x2-D, …, x 0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T-1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The information-theoretic capacity of discrete-time queues

    Publication Year: 1998, Page(s):446 - 461
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The information-theoretic capacity of continuous-time queues was analyzed recently by Anantharam and Verdu (see ibid. vol.42, p.4-18, 1996). Along similar lines, we analyze the information-theoretic capacity of two models of discrete-time queues. The first model has single packet arrivals and departures in a time slot and independent packet service times, and is the discrete-time analog of the con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The shape of low excursions of the envelope of a signal plus noise

    Publication Year: 1998, Page(s):882 - 886
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    Like low excursions of the envelope of narrowband noise, those of the sum of a signal plus narrowband noise are hyperbolic in shape if the signal-to-noise ratio r is not high. When r≫1, low excursions of the envelope are hyperbolic if the signal is frequency-modulated but have a quartic shape with one or two minima if it is not. This article illuminates various aspects of FM clicks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic lossy source/channel coding

    Publication Year: 1998, Page(s):564 - 579
    Cited by:  Papers (156)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The fundamental limits of “systematic” communication are analyzed. In systematic transmission, the decoder has access to a noisy version of the uncoded raw data (analog or digital). The coded version of the data is used to reduce the average reproduced distortion D below that provided by the uncoded systematic link and/or increase the rate of information transmission. Unlike the case o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy of the Lempel-Ziv string matching code

    Publication Year: 1998, Page(s):787 - 791
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    For any given source output string from a unifilar, Markov source, we bound from above the amount by which the number of binary digits used by two variants of LZ'77 to encode the string exceeds its self-information as a function of its length and self-information View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic eigenvalue distribution of block-Toeplitz matrices

    Publication Year: 1998, Page(s):858 - 861
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    The need for approximating block-Toeplitz with Toeplitz block matrices by means of block-circulant with circulant block matrices with the objective of transforming an inherently ill-posed image deconvolution problem to a well-posed one motivated a surge of papers on the analysis of the quality as well as the speed of convergence of the algorithms that produce such approximants to serve as precondi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth-efficient coded modulation with optimized linear partial-response signals

    Publication Year: 1998, Page(s):701 - 713
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    We study the design of optimal signals for bandwidth-efficient linear coded modulation. Previous results show that for linear channels with intersymbol interference (ISI), reduced-search decoding algorithms have near-maximum-likelihood error performance, but with much smaller complexity than the Viterbi decoder. Consequently, the controlled ISI introduced by a lowpass filter can be practically use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed random signal detection with multibit sensor decisions

    Publication Year: 1998, Page(s):516 - 524
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    Distributed detection of weak random signals in additive, possibly non-Gaussian, noise is considered for cases with multibit sensor decisions. Signal-to-noise ratios are assumed unknown and the signals at the different sensors may be statistically dependent. Analytical expressions are provided that describe the best way to fuse the quantized observations for cases with any given number of sensors.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleaving schemes for multidimensional cluster errors

    Publication Year: 1998, Page(s):730 - 743
    Cited by:  Papers (50)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    We present two-dimensional and three-dimensional interleaving techniques for correcting two- and three-dimensional bursts (or clusters) of errors, where a cluster of errors is characterized by its area or volume. Correction of multidimensional error clusters is required in holographic storage, an emerging application of considerable importance. Our main contribution is the construction of efficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shannon capacity of M-ary redundant multitrack runlength limited codes

    Publication Year: 1998, Page(s):766 - 774
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    We consider multiamplitude, multitrack runlength-limited (d, k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual runlength-limited constraint graph is used. The introduced graph model has the vertex labeling independent of number ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder

    Publication Year: 1998, Page(s):831 - 838
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of encode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotic analysis of DS/SSMA communication systems with general linear modulation and error control coding

    Publication Year: 1998, Page(s):870 - 881
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    We investigate direct-sequence spread-spectrum multiple-access (DS/SSMA) communication systems with general linear modulation and error control coding. By the central limit theorem for martingale difference arrays, it is proved that under general conditions, the overall multiple-access interference (MAI) across different symbol intervals tends to a jointly complex Gaussian random vector as both th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information and control: matching channels

    Publication Year: 1998, Page(s):542 - 563
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1268 KB)

    The transmission problem for noisy channels is usually studied under the condition that the decoding error probability λ is small and is sometimes studied under the condition that λ=0. Here we just require that λ<1 and obtain a problem which is equivalent to a coding problem with small λ for the “deterministic matching channel.” In this new model, a coope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some notes on Rissanen's stochastic complexity

    Publication Year: 1998, Page(s):782 - 786
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    A new version of stochastic complexity for a parametric statistical model is derived, based on a class of two-part codes. We show that choosing the quantization in the first step according to the Fisher information is optimal and we compare our approach to a recent result of Rissanen (1983). An application to robust regression model selection is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact recovery of higher order moments

    Publication Year: 1998, Page(s):851 - 858
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    This correspondence addresses the problem of exact recovery of higher order moments of unquantized signals from those of their quantized counterparts, in the context of nonsubtractive dithered quantization. It introduces a new statistical characterization of the dithered quantizer in the form of a pth-order moment-sense input/ouput function hp (x). A class of signals for which the solut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified method for evaluating the error-correction radius of reliability-based soft-decision algorithms for linear block codes

    Publication Year: 1998, Page(s):691 - 700
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    This paper presents a unified method for evaluating the error-correction radii of many reliability-based soft-decision decoding algorithms for binary linear block codes. Based on this unified method, these decoding algorithms as well as their potential improvements can be compared directly. The error-correction radius for each of these decoding algorithms is determined by finding the closest point... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent results on polyphase sequences

    Publication Year: 1998, Page(s):817 - 824
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    A polyphase sequence of length n+1, A={aj}j=0n, is a sequence of complex numbers, each of unit magnitude. The (unnormalized) aperiodic autocorrelation function of a sequence is denoted by C(τ). Associated with the sequence A, the sequence polynomial fA(z) of degree n and the correlation polynomial gA(z) of degree 2n are defined. For each r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic multiuser efficiencies for decision-directed multiuser detectors

    Publication Year: 1998, Page(s):502 - 515
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    The asymptotic multiuser efficiencies (AMEs) are derived for various classes of decision-directed multiuser detectors, including multistage detectors, and decision-feedback detectors. Novel classes of soft-decision multistage detectors are proposed and analyzed. Each class is specified in part by a soft-decision nonlinearity, such as a symmetric quantizer or a linear clipper. Closed-form expressio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric estimation of transfer functions: rates of convergence and adaptation

    Publication Year: 1998, Page(s):644 - 658
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    The paper deals with estimating the transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for measuring the estimation accuracy. The quality of an estimator is measured by its worst case error over a family of transfer functions. The families with polynomially and exponentially decaying impulse response sequences are cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new extremal self-dual codes with lengths 44, 50, 54, and 58

    Publication Year: 1998, Page(s):809 - 812
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    We construct extremal self-dual codes with lengths 44, 50, 54, and 58. They have weight enumerators for which extremal codes were previously not known to exist. Two methods are used for constructing the codes using self dual codes of same or smaller length. To obtain the codes we use a combinatorial optimization search 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