By Topic

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
  • 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 the generalized Hamming weights of convolutional codes

    Publication Year: 1997, Page(s):330 - 335
    Cited by:  Papers (2)
    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.
  • Identification via compressed data

    Publication Year: 1997, Page(s):48 - 70
    Cited by:  Papers (17)
    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.
  • 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.
  • Block-coded modulation optimized for finite error rate on the white Gaussian noise channel

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

    This correspondence examines the performance of block-coded modulation (BCM) at finite decoded bit error rates (BER). We consider the optimum geometric structure to optimize coding gain at finite BER, rather than asymptotic coding gain. We introduce the concept of the “row BER” and show that this structure may be implemented by a BCM scheme in which the row bit-error rates are equalize... 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.
  • Binary odd-periodic complementary sequences

    Publication Year: 1997, Page(s):365 - 367
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    A pair of binary sequences is called complementary if the sum of their aperiodic autocorrelation functions is zero except for zero shift. Such sequences are known for relatively few lengths. This correspondence therefore introduces pairs of binary odd-periodic complementary sequences, which can be constructed using q-ary m-sequences for many more lengths 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 (2)
    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.
  • 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.
  • 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 (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1204 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.
  • The computational intractability of training sigmoidal neural networks

    Publication Year: 1997, Page(s):167 - 173
    Cited by:  Papers (15)
    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.
  • A note on permutation modulation

    Publication Year: 1997, Page(s):359 - 360
    Cited by:  Papers (2)
    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.
  • 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.
  • Statistics of chaotic binary sequences

    Publication Year: 1997, Page(s):104 - 112
    Cited by:  Papers (165)  |  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.
  • 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.
  • 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.
  • Nonparametric estimation of instantaneous frequency

    Publication Year: 1997, Page(s):183 - 189
    Cited by:  Papers (27)
    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 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.
  • 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.
  • 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.
  • On the role of mismatch in rate distortion theory

    Publication Year: 1997, Page(s):38 - 47
    Cited by:  Papers (40)
    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.
  • 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.

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