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

    Publication Year: 1997, Page(s):386 - 390
    Request permission for commercial reuse | PDF file iconPDF (679 KB)
    Freely Available from IEEE
  • Optimal linear codes of dimension 4 over F5

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

    Let nq(k,d) be the smallest integer n for which there exists a linear code of length n, dimension k, and minimum distance d, over a field of q elements. In this correspondence we determine n5 (4,d) for all but 22 values of d 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 cyclic codes

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

    We prove several results on the generalized Hamming weights (GHW's) of linear codes, particularly for cyclic codes. Based on these and previously known results, we give some efficient algorithms for computing GHW hierarchy of cyclic codes. We give complete weight hierarchy for each of the binary cyclic codes of odd lengths ⩽31. A table of second and third GHW's of binary cyclic codes of odd le... 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.
  • 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 (1252 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.
  • 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.
  • 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.
  • 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 (1276 KB)

    Ahlswede has previously introduced an abstract correlated source (𝒱×𝒲,S) with outputs (υ, ω)∈S⊂𝒱×𝒲, where persons P𝒱 and P𝒲 observe υ and ω, respectively. More recently, Orlitsky considered the minimal number C m of bits to be transmitted in m rounds to “inform P 𝒲 about ... 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.
  • 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 (652 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.
  • 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.
  • 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.
  • Characteristics of guided scrambling encoders and their coded sequences

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

    We derive several properties of guided scrambling (GS) encoders and the sequences they generate. We first highlight symmetrical aspects of the GS encoding mechanisms proposed to date, and then show that the existence of discrete components in the power spectrum of the pulse-amplitude-modulated encoded sequence can be predicted from the weight of the scrambling polynomial. We also show that with eq... 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.
  • The redundancy of source coding with a fidelity criterion. 1. Known statistics

    Publication Year: 1997, Page(s):71 - 91
    Cited by:  Papers (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 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 Dn(R) of fixed-rate coding is defined as the minimum of the difference between the expected distortion per symbol of any block code... 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 (1048 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.
  • 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.
  • 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.
  • Failure of successive refinement for symmetric Gaussian mixtures

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

    We show that information refinement fails for a continuous alphabet source whose input distribution is the symmetric mixture of normal densities with means -μ and μ and common variance σ 2 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.
  • How an Erdos-Renyi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback

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

    Pippenger (1981) showed in a probabilistic way that the capacity of a collision channel with multiplicity feedback is one. In this correspondence, using an Erdos-Renyi type search strategy, we settle a long-standing open problem by giving a constructive proof of this result. Moreover, we prove that two different capacity definitions are equivalent, thereby solving a problem posed by Tsybakov (1985... 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.
  • Cascading methods for runlength-limited arrays

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

    Runlength-limited sequences and arrays have found applications in magnetic and optical recording. While the constrained sequences are well studied, little is known about constrained arrays. In this correspondence we consider the question of how to cascade two arrays with the same runlength constraints horizontally and vertically, in such a way that the runlength constraints will not be violated. W... 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.

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