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
  • 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.
  • 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.
  • 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.
  • 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.
  • Almost-perfect polyphase sequences with small phase alphabet

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

    New classes of polyphase sequences with small phase alphabets of size k are presented. These almost-perfect sequences of length N have a vanishing periodic autocorrelation function Θ(τ) for all τ≠0 mod (N/k). The sequences are derived from q-ary m-sequences by a k-valued character operation 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • The covering radius of extremal self-dual code D11 and its application

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

    D11, constructed by Conway and Sloane, is an extremal self-dual [56,28,12]-code with weight enumerator 1+8190y12+622314y16+11699688y20 +… . We find that the covering radius of D11 is 10. This shows that the inequality R(C56)⩽10 cannot be improved any more, where R(C56) is the covering radius of any extremal doubly even [56,28,12]-co... 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.
  • 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.
  • 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.
  • A note on permutation modulation

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

    Slepian (1962) observed that the code points in an n-dimensional variant-1 permutation modulation code actually lie in an n-1-dimensional subspace. In this correspondence, a change of coordinates which gives the representation explicitly in n-1 dimensions is derived. Slepian's optimum decoding algorithm can be adapted to the codes in this form using an idea of Biglieri and Elia (1976) 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.
  • 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 computational intractability of training sigmoidal neural networks

    Publication Year: 1997, Page(s):167 - 173
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 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.
  • New optimal binary linear codes of dimensions 9 and 10

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

    Eighteen new codes are presented which improve the bounds on maximum minimum distance for binary linear codes. They are rate (m-r)/pm, r⩾1, degenerate quasi-cyclic (QC) codes. Based on the known upper bounds, six of these new codes are optimal. In addition, five two-weight QC codes of dimension 8 are given 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.
  • 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.
  • 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 (768 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.

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