IEEE Transactions on Information Theory

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.
  • Contributors

    Publication Year: 1997, Page(s):386 - 390
    Request permission for commercial reuse | |PDF file iconPDF (679 KB)
    Freely Available from IEEE
  • 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 (1008 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.
  • Statistics of chaotic binary sequences

    Publication Year: 1997, Page(s):104 - 112
    Cited by:  Papers (168)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (624 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.
  • 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 (1104 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.
  • 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 (340 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.
  • Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. I

    Publication Year: 1997, Page(s):190 - 207
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1892 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.
  • Two-step trellis decoding of partial unit memory convolutional codes

    Publication Year: 1997, Page(s):324 - 330
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (740 KB)

    We present a new soft-decision decoding method for high-rate convolutional codes. The decoding method is especially well-suited for PUM convolutional codes. The method exploits the linearity of the parallel transitions in the trellis associated with PUM codes. We provide bounds on the number of operations per decoded bit, and show that this number is dependent on the weight hierarchy of the linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Golomb rectangles as folded rulers

    Publication Year: 1997, Page(s):290 - 293
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (368 KB)

    A correspondence between two-dimensional Golomb rectangles and one-dimensional Golomb rulers is given. Results are translated from rulers to rectangles. The extension of these results to an arbitrary number of dimensions is given. A new bound is developed on the number of ones in a Golomb array of any dimension. Some new optimum Golomb squares, rectangles, and higher dimensional arrays are given 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 (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1748 KB)

    A new coding problem is introduced for a correlated source (Xn,Yn)n=1∞. The observer of Xn can transmit data depending on Xn at a prescribed rate R. Based on these data the observer of Yn tries to identify whether for some distortion measure ρ (like the Hamming distance) n-1 ρ(Xn,Y 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 (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (340 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.
  • 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 (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (476 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.
  • 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 (716 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.
  • Lattice vector quantization of generalized Gaussian sources

    Publication Year: 1997, Page(s):92 - 103
    Cited by:  Papers (29)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1224 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 ν. 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 high pe... 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 (1308 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.
  • On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two

    Publication Year: 1997, Page(s):294 - 298
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (612 KB)

    The generalized Hamming weights introduced by Wei (1991) have been shown to be fundamental descriptive parameters of a linear block code. They have been found to be useful in certain cryptographic applications and in the studies of minimal trellis diagrams of linear block codes. In this correspondence, we determine the first few and the last few generalized Hamming weights of binary primitive BCH ... 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 (1360 KB)

    The set of all even subgraphs of a connected graph G on p vertices with q edges forms a binary linear code C=CE(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 augment... 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 (584 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.
  • On the generalized Hamming weights of convolutional codes

    Publication Year: 1997, Page(s):330 - 335
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (600 KB)

    Motivated by applications in cryptology, Wei (1991) introduced the concept of a generalized Hamming weight for a linear block code. In this correspondence, we define generalized Hamming weights for the class of convolutional codes and we derive several of their basic properties. By restricting to convolutional codes having a generator matrix G(D) with bounded Kronecker indices we are able to deriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On codes correcting weakly localized errors

    Publication Year: 1997, Page(s):363 - 364
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (160 KB)

    It is proved that the Hamming bound is asymptotically tight for codes correcting weakly localized errors, when the number of errors is fixed 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 (1228 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.
  • Rate distortion efficiency of subband coding with crossband prediction

    Publication Year: 1997, Page(s):352 - 356
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (520 KB)

    Traditional subband coding, where each subband is encoded independently, has been shown by Fischer (1992) to be suboptimum for encoding Gaussian sources in the rate-distortion sense. We show here that if we use prediction across subbands when encoding Gaussian sources, the resulting coder is asymptotically rate-distortion-optimum at high rate. We also show for Gauss-Markov sources that although th... 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 (41)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (952 KB)

    Using a codebook C, a source sequence is described by the codeword that is closest to it according to the distortion measure d0(x,xˆ0). Based on this description, the source sequence is reconstructed to minimize the reconstruction distortion as measured by d1(x,xˆ1), where, in general, d1(x,xˆ1)≠d0(x,x&c... 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 (1424 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.
  • A forbidden rate region for generalized cross constellations

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

    An analysis of the generalized cross constellation (GCC) is presented and a new perspective on its coding algorithm is described. We show how the GCC can be used to address generic sets of symbol points in any multidimensional space through an example based on the matched spectral null coding used in magnetic recording devices. We also prove that there is a forbidden rate region of fractional codi... 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