IEEE Transactions on Information Theory

Issue 6 • Sept. 2000

Filter Results

Displaying Results 1 - 25 of 32
  • New deterministic interleaver designs for turbo codes

    Publication Year: 2000, Page(s):1988 - 2006
    Cited by:  Papers (72)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    It is well known that an interleaver with random properties, quite often generated by pseudo-random algorithms, is one of the essential building blocks of turbo codes. However, randomly generated interleavers have two major drawbacks: lack of an adequate analysis that guarantees their performance and lack of a compact representation that leads to a simple implementation. We present several new cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum-weight codewords as generators of generalized Reed-Muller codes

    Publication Year: 2000, Page(s):2152 - 2158
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    We establish the range of values of ρ, where 0⩽ρ⩽m(q-1), for which the generalized Reed-Muller code RFq(ρ, m) of length qm over the field Fq of order q is spanned by its minimum-weight vectors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds

    Publication Year: 2000, Page(s):2133 - 2151
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    We derive bounds for optimal rate allocation between source and channel coding for linear channel codes that meet the Gilbert-Varshamov or Tsfasman-Vladut-Zink (1984) bounds. Formulas giving the high resolution vector quantizer distortion of these systems are also derived. In addition, we give bounds on how far below the channel capacity the transmission rate should be for a given delay constraint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Macroscopic 1/f behavior of fractal signals generated by additive substitution

    Publication Year: 2000, Page(s):2261 - 2268
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    We analyze the structure of the discrete Fourier transform of a particular class of self-similar discrete signals which are iteratively generated by an additive substitution procedure, starting from a finite generator sequence. The amplitude spectra of such signals obtained from different generators have a similar form. The amplitude spectrum contains several affine branches, the number of which d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First- and second-order characterization of direction dispersion and space selectivity in the radio channel

    Publication Year: 2000, Page(s):2027 - 2044
    Cited by:  Papers (128)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    We present analytical results relating to first- and second-moment characterization of direction dispersion and spatial selectivity in the radio channel as well as to the duality between these two effects. Dispersion in direction can be characterized either by the direction power spectrum or by a family of spatial Doppler power spectra at the reception site. Two measures called the direction sprea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large system performance of linear multiuser receivers in multipath fading channels

    Publication Year: 2000, Page(s):2059 - 2078
    Cited by:  Papers (205)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    A linear multiuser receiver for a particular user in a code-division multiple-access (CDMA) network gains potential benefits from knowledge of the channels of all users in the system. In fast multipath fading environments we cannot assume that the channel estimates are perfect and the inevitable channel estimation errors will limit this potential gain. We study the impact of channel estimation err... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A suboptimal quadratic change detection scheme

    Publication Year: 2000, Page(s):2095 - 2107
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    We address the problem of detecting changes in multivariate Gaussian random signals with an unknown mean after the change. The window-limited generalized-likelihood ratio (GLR) scheme is a well-known approach to solve this problem. However, this algorithm involves at least (log γ)/ρ likelihood-ratio computations at each stage, where γ(γ→∞) is the mean time before a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The reliability functions of the general source with fixed-length coding

    Publication Year: 2000, Page(s):2117 - 2132
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    The reliability function problems with fixed-length source coding for the general source are studied for all rates R. Our fundamental philosophy in doing so is to convert all of the reliability function problems to the pertinent computation problems in the large derivation-probability theory. It turns out that this kind of new methodology, which was previously developed by Han (see ibid., vol.43, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On algebraic decoding of the Z4-linear Goethals-like codes

    Publication Year: 2000, Page(s):2193 - 2197
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    The Z4-linear Goethals-like code of length 2m has 22m+1-3m-2 codewords and minimum Lee distance 8 for any odd integer m⩾3. We present an algebraic decoding algorithm for all Z4-linear Goethals-like codes Ck introduced by Helleseth et al.(1995, 1996). We use Dickson polynomials and their properties to solve the syndrome equations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability function of general classical-quantum channel

    Publication Year: 2000, Page(s):2256 - 2261
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    In information theory, the reliability function and its bounds, describing the exponential behavior of the error probability, are important quantitative characteristics of the channel performance. From a more general point of view, these bounds provide certain measures of distinguishability of a given set of classical states. In a previous paper, quantum analogs of the random coding and expurgatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modulation and coding for the Gaussian collision channel

    Publication Year: 2000, Page(s):2007 - 2026
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    We study signal-space coding for coherent slow frequency-hopped communications over a Gaussian multiple-access collision channel (G-MACC). We define signal sets and interleavers having maximum collision resistance. The packet-error probability and the spectral efficiency obtained by these signal sets concatenated with outer block coding and hard (error-only) decoding is evaluated without assuming ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic design of unitary space-time constellations

    Publication Year: 2000, Page(s):1962 - 1973
    Cited by:  Papers (425)  |  Patents (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    We propose a systematic method for creating constellations of unitary space-time signals for multiple-antenna communication links. Unitary space-time signals, which are orthonormal in time across the antennas, have been shown to be well-tailored to a Rayleigh fading channel where neither the transmitter nor the receiver knows the fading coefficients. The signals can achieve low probability of erro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of linear codes with good parameters

    Publication Year: 2000, Page(s):2184 - 2188
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    A construction of linear codes with good parameters is given. Based on Brouwer's table, more than 100 new codes are obtained from our construction View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The super-trellis structure of turbo codes

    Publication Year: 2000, Page(s):2212 - 2228
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we can o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial complexity optimal detection of certain multiple-access systems

    Publication Year: 2000, Page(s):2246 - 2248
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    It is demonstrated that optimal multiple-user detection in a linear multiple-access system with identical crosscorrelations requires only 𝒪(KlogK) operations instead of the worst case O(2K). A simple optimal detection algorithm is given, which when generalized has a complexity that is exponential not in the number of users but in the number of unique crosscorrelation values View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the linear complexity profile of the power generator

    Publication Year: 2000, Page(s):2159 - 2162
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    We obtain a lower bound on the linear complexity profile of the power generator of pseudo-random numbers modulo a Blum integer. A different method is also proposed to estimate the linear complexity profile of the Blum-Blum-Shub (1986) generator. In particular, these results imply that lattice reduction attacks on such generators are not feasible View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal design for bandwidth-efficient multiple-access communications based on eigenvalue optimization

    Publication Year: 2000, Page(s):2045 - 2058
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    Bandwidth-efficient multiple access (BEMA) is a strategy where transmitter pulses are continually designed at the base station and are dynamically allocated to the transmitters via a feedback channel. Such pulses (or “signature waveforms”) are designed to conserve bandwidth while simultaneously enabling the receiver at the base station to meet a quality-of-service (QoS) specification f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering

    Publication Year: 2000, Page(s):2079 - 2094
    Cited by:  Papers (127)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    A novel adaptive Bayesian receiver for signal detection and decoding in fading channels with known channel statistics is developed; it is based on the sequential Monte Carlo methodology that has emerged in the field of statistics. The basic idea is to treat the transmitted signals as “missing data” and to sequentially impute multiple samples of them based on the observed signals. The i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theorems on the variable-length intrinsic randomness

    Publication Year: 2000, Page(s):2108 - 2116
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We address variable-length intrinsic randomness problems (in the sense of Vembu and Verdu (1995)) for countably infinite source alphabet χ under the (unnormalized) divergence distance, the normalized conditional divergence distance, and the variational distance. It turns out that under all three kinds of approximation measures the variable-length intrinsic randomness still takes the same value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the depth distribution of linear codes

    Publication Year: 2000, Page(s):2197 - 2203
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB)

    The depth distribution of a linear code was recently introduced by T. Etzion (see ibid., vol.43, pp.1361-3, July 1997). In this correspondence, a number of basic and interesting properties for the depth of finite words and the depth distribution of linear codes are obtained. In addition, we study the enumeration problem of counting the number of linear subcodes with the prescribed depth constraint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the existence and construction of good codes with low peak-to-average power ratios

    Publication Year: 2000, Page(s):1974 - 1987
    Cited by:  Papers (160)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    The first lower bound on the peak-to-average power ratio (PAPR) of a constant energy code of a given length n, minimum Euclidean distance and rate is established. Conversely, using a nonconstructive Varshamov-Gilbert style argument yields a lower bound on the achievable rate of a code of a given length, minimum Euclidean distance and maximum PAPR. The derivation of these bounds relies on a geometr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal codes for single-error correction, double-adjacent-error detection

    Publication Year: 2000, Page(s):2188 - 2193
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    In certain memory systems the most common error is a single error and the next most common error is two errors in positions which are stored physically adjacent in the memory. In this correspondence we present optimal codes for recovering from such errors. We correct single errors and detect double adjacent errors. For detecting adjacent errors we consider codes which are byte-organized. In the bi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The weight hierarchies of some product codes

    Publication Year: 2000, Page(s):2228 - 2235
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    We determine the weight hierarchies of the product of an n-tuple space and an arbitrary code, the product of an m-dimensional even-weight code and the [24,12,8] extended Golay code, and the product of an m-dimensional even-weight code and the [8,4,4] extended Hamming code. The conjecture dr=d*r is proven for all three cases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on variances of recovery times of decision feedback equalizers

    Publication Year: 2000, Page(s):2249 - 2256
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    New upper and lower bounds on the variances of the recovery times of decision feedback equalizers are derived. The analysis is based on generalizing a difference equation technique, used previously only for first-order moments, to second-order moments. The different error recovery time variances resulting from random channel errors and from the reset or startup condition are both investigated. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of contention tree algorithms

    Publication Year: 2000, Page(s):2163 - 2172
    Cited by:  Papers (47)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    The Capetanakis-Tsybakov-Mikhailov (1978, 1979) contention tree algorithm provides an efficient scheme for multiaccessing a broadcast-communication channel. This paper studies the statistical properties of multiple-access contention tree algorithms with ternary feedback for an arbitrary degree of node. The particular quantities under investigation are the number of levels required for a random con... 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