IEEE Transactions on Information Theory

Volume 43 Issue 1 • Jan. 1997

Filter Results

Displaying Results 1 - 25 of 48
  • On the average redundancy rate of the Lempel-Ziv code

    Publication Year: 1997, Page(s):2 - 8
    Cited by:  Papers (57)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB)

    In this paper, we settle a long-standing open problem concerning the average redundancy r/sub n/ of the Lempel-Ziv'78 (LZ78) code. We prove that for a memoryless source the average redundancy rate attains asymptotically Er/sub n/=(A+/spl delta/(n))/log n+ O(log log n/log/sup 2/ n), where A is an explicitly given constant that depends on source characteristics, and /spl delta/(x) is a fluctuating f... 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 incremental parsing rule

    Publication Year: 1997, Page(s):9 - 21
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1169 KB)

    The Lempel-Ziv codes are universal variable-to-fixed length codes that have become virtually standard in practical lossless data compression. For any given source output string from a Markov or unifilar source, we upper-bound the difference between the number of binary digits needed to encode the string and the self-information of the string. We use this result to demonstrate that for unifilar or ... View full abstract»

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

    Publication Year: 1997, Page(s):22 - 37
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1433 KB)

    Ahlswede has previously introduced an abstract correlated source (/spl Vscr//spl times//spl Wscr/,S) with outputs (/spl upsi/, /spl omega/)/spl isin/S/spl sub//spl Vscr//spl times//spl Wscr/, where persons P/sub /spl Vscr// and P/sub /spl Wscr// observe /spl upsi/ and /spl omega/, respectively. More recently, Orlitsky considered the minimal number C/sub m/ of bits to be transmitted in m rounds to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the role of mismatch in rate distortion theory

    Publication Year: 1997, Page(s):38 - 47
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1055 KB)

    Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d/sub 0/(x,x/spl circ//sub 0/). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d/sub 1/(x,x/spl circ//sub 1/), where, in general, d/sub 1/(x,x/spl circ//sub 1/)/spl ne/d/sub 0/(x,x/spl circ//sub 0/). W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification via compressed data

    Publication Year: 1997, Page(s):48 - 70
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB)

    A new coding problem is introduced for a correlated source (X/sup n/,Y/sup n/)/sub n=1//sup /spl infin//. The observer of X/sup n/ can transmit data depending on X/sup n/ at a prescribed rate R. Based on these data the observer of Y/sup n/ tries to identify whether for some distortion measure /spl rho/ (like the Hamming distance) n/sup -1/ /spl rho/(X/sup n/,Y/sup n/)/spl les/d, a prescribed fidel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The redundancy of source coding with a fidelity criterion. 1. Known statistics

    Publication Year: 1997, Page(s):71 - 91
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1661 KB)

    The problem of redundancy of source coding with respect to a fidelity criterion is considered. For any fixed rate R>0 and any memoryless source with finite source and reproduction alphabets and a common distribution p, the nth-order distortion redundancy D/sub n/(R) of fixed-rate coding is defined as the minimum of the difference between the expected distortion per symbol of any block code with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice vector quantization of generalized Gaussian sources

    Publication Year: 1997, Page(s):92 - 103
    Cited by:  Papers (32)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1337 KB)

    Many important sources of data including sub-band image and speech coefficients are highly peaked and can be well-modeled by the family of generalized Gaussian (GG) PDFs parameterized by a shape parameter /spl nu/. We present here algorithms for defining and quantizing to a Z lattice in which the boundary is optimized to the characteristics of GG sources, and show that these techniques lead to hig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistics of chaotic binary sequences

    Publication Year: 1997, Page(s):104 - 112
    Cited by:  Papers (174)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (693 KB)

    Statistical properties of binary sequences generated by a class of ergodic maps with some symmetric properties are discussed on the basis of an ensemble-average technique. We give a simple sufficient condition for such a class of maps to produce a fair Bernoulli sequence, that is, a sequence of independent and identically distributed (i.i.d.) binary random variables. This condition is expressed in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of coded systems

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

    There are many situations in which a coding scheme is fixed for a given channel. The data processing theorem implies that the capacity of the composite channel cannot be higher than that of the original channel; usually, the capacity will be strictly lower. This paper examines the problem of how much capacity must be lost in the most common such situations. The various combinations of presence and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps

    Publication Year: 1997, Page(s):128 - 135
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB)

    We present a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The construction is based on the tower of Artin-Schreier extensions described by Garcia and Stichtenoth (1995). We also determine the dual codes. The first steps of the constructions are explicitly given as generator matrices. View full abstract»

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

    Publication Year: 1997, Page(s):136 - 146
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1499 KB)

    The set of all even subgraphs of a connected graph G on p vertices with q edges forms a binary linear code C=C/sub E/(G) with parameters [q,q-p+1,g], where g is the girth of G. Such codes were studied systematically by Bredeson and Hakimi (1967) and Hakimi and Bredeson (1968) who were concerned with the problems of augmenting C to a larger [q,k,g]-code and of efficiently decoding such augmented gr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Factoring polynomials using binary representations of finite fields

    Publication Year: 1997, Page(s):147 - 153
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (857 KB)

    The factorization of polynomials over finite fields is considered. A new deterministic algorithm is proposed that solves the equal-degree factorization problem by combining Berlekamp's (1970) trace algorithm iterative method with the concept of binary representations of finite fields. The interesting aspects of the new algorithm are its simple structure, the easy proof of its correctness, and its ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning decision rules for pattern classification under a family of probability measures

    Publication Year: 1997, Page(s):154 - 166
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1454 KB)

    In this paper, uniformly consistent estimation (learnability) of decision rules for pattern classification under a family of probability measures is investigated. In particular, it is shown that uniform boundedness of the metric entropy of the class of decision rules is both necessary and sufficient for learnability under each of two conditions: (i) the family of probability measures is totally bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The computational intractability of training sigmoidal neural networks

    Publication Year: 1997, Page(s):167 - 173
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (754 KB)

    We demonstrate that the problem of approximately interpolating a target function by a neural network is computationally intractable. In particular the interpolation training problem for a neural network with two monotone Lipschitzian sigmoidal internal activation functions and one linear output node is shown to be NP-hard and NP-complete if the internal nodes are in addition piecewise ratios of po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Waveform recognition in the presence of domain and amplitude noise

    Publication Year: 1997, Page(s):174 - 182
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (806 KB)

    In this paper, we discuss the problem of recognizing single-dimensional, real-valued, functions in the presence of domain noise (i.e., noise that affects the domain rather than the amplitude). This problem is inspired by the field of on-line character recognition where it is more natural to view the hand as deforming the domain of the character rather than adding noise to its amplitude. The result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric estimation of instantaneous frequency

    Publication Year: 1997, Page(s):183 - 189
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (653 KB)

    The local polynomial approximation of time-varying phase is used in order to estimate the instantaneous frequency and its derivatives for a complex-valued harmonic signal given by discrete-time observations with a noise. The considered estimators are high-order nonparametric generalizations of the short-time Fourier transform and the Wigner-Ville distribution. The asymptotic variance and bias of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. I

    Publication Year: 1997, Page(s):190 - 207
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2082 KB)

    We consider the sampling of bandlimited spatiotemporal signals subject to the time-sequential (TS) constraint that only one spatial position can be sampled at any given time. Using the powerful techniques of lattice theory, we develop a new unifying theory linking TS sampling with generalized multidimensional sampling. The results have a geometric nature, involving simultaneous packing of the spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. II. Large space-bandwidth product asymptotics

    Publication Year: 1997, Page(s):208 - 220
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1335 KB)

    For pt.I see ibid., vol.43, no.1, p.190-207 (1997). We consider the sampling of bandlimited spatiotemporal signals subject to the time-sequential (TS) constraint that only one spatial position can be sampled at any given time. Part I of this paper developed a new unifying theory linking TS sampling with generalized multidimensional sampling. It provided a complete characterization of time-sequenti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of sequential tests between Poisson processes

    Publication Year: 1997, Page(s):221 - 238
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1572 KB)

    The problem of performance computation for sequential tests between Poisson processes is considered. The average sample numbers and error probabilities of the sequential probability ratio test (SPRT) between two homogeneous Poisson processes are known to solve certain delay-differential equations (DDEs). Exact, numerically stable solutions to these DDEs are developed here, and their asymptotic pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

    Publication Year: 1997, Page(s):239 - 249
    Cited by:  Papers (47)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB)

    Efficient code-search maximum-likelihood decoding algorithms, based on reliability information, are presented for binary Linear block codes. The codewords examined are obtained via encoding. The information set utilized for encoding comprises the positions of those columns of a generator matrix G of the code which, for a given received sequence, constitute the most reliable basis for the column sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate

    Publication Year: 1997, Page(s):250 - 262
    Cited by:  Papers (48)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1197 KB)

    This paper presents some trellis codes that provide high coding gain to channels with slow, non frequency-selective Rayleigh fading. It is shown that the use of two encoders in parallel-used to specify the in-phase and quadrature components of the transmitted signal-results in greater minimum time diversity than the conventional design in which a single encoder is used. Using this approach-which w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-error-probability for noncoherent orthogonal signals in fading with optimum combining for correlated branch diversity

    Publication Year: 1997, Page(s):263 - 274
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1106 KB)

    Due to the interest in wireless personal communications, there has been a lot of research on the performance of receivers with diversity. Most analyses assume the diversity branches are independent. This paper presents an analysis of the bit-error probability for receivers in which the diversity branches are correlated. Noncoherent orthogonal digital modulation (NCODM) with Rician and Rayleigh slo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced complexity sequence detection for nonminimum phase intersymbol interference channels

    Publication Year: 1997, Page(s):275 - 280
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    Controlled intersymbol interference may be used to design bandwidth efficient coded modulation schemes. The performance of the optimum receiver depends only on the free distance of the code and is independent of its phase. Large reductions in receiver complexity are obtained by using reduced search detection techniques like the M-algorithm (MA). However, we show that MA detector performance depend... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotics of M-hypothesis Bayesian detection

    Publication Year: 1997, Page(s):280 - 282
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (381 KB)

    In two-hypothesis detection problems with i.i.d. observations, the minimum error probability decays exponentially with the amount of data, with the constant in the exponent equal to the Chernoff distance between the probability distributions characterizing the hypotheses. We extend this result to the general M-hypothesis Bayesian detection problem where zero cost is assigned to correct decisions, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency of orthogonal series density estimators based on grouped observations

    Publication Year: 1997, Page(s):283 - 285
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB)

    In this correspondence we show that nonparametric orthogonal series estimators of probability densities retain the mean integrated square error (MISE) consistency when observations are grouped to the points of a uniform grid (prebinned). This kind of grouping is typical for computer rounding errors and may also be useful in data compression, before calculating estimates, e.g., using the FFT. The m... 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