Scheduled System Maintenance
On Tuesday, January 23, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 6 • Sept. 1999

Filter Results

Displaying Results 1 - 25 of 56
  • Correction to "New double-byte error-correcting codes for memory systems"

    Publication Year: 1999, Page(s): 2209
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (20 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transform domain analysis of DES

    Publication Year: 1999, Page(s):2065 - 2073
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    The Data Encryption Standard (DES) can be regarded as a nonlinear feedback shift register (NLFSR) with input. From this point of view, the tools for pseudo-random sequence analysis are applied to the S-boxes in DES. The properties of the S-boxes of DES under the Fourier transform, Hadamard transform, extended Hadamard transform, and the Avalanche transform are investigated. Two important results a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear span of extended sequences and cascaded GMW sequences

    Publication Year: 1999, Page(s):2060 - 2065
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    In this correspondence, the linear span of extended sequences of period 2em-1 which are constructed from the ideally correlated sequences of period of 2m-1 is derived. It is also shown that the linear span of cascaded Gordon-Mills-Welch (GMW) sequences can be derived in the same context. As examples, the linear span of extended Legendre sequences and cascaded GMW sequences wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the average near-far resistance for MMSE detection of direct sequence CDMA signals with random spreading

    Publication Year: 1999, Page(s):2039 - 2045
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    The performance of a near-far-resistant, finite-complexity, minimum mean squared error (MMSE) linear detector for demodulating direct sequence (DS) code-division multiple access (CDMA) signals is studied, assuming that the users are assigned random signature sequences. We obtain tight upper and lower bounds on the expected near-far resistance of the MMSE detector, averaged over signature sequences... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Shannon cipher system with a guessing wiretapper

    Publication Year: 1999, Page(s):1860 - 1866
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    The Shannon theory of cipher systems is combined with recent work on guessing values of random variables. The security of encryption systems is measured in terms of moments of the number of guesses needed for the wiretapper to uncover the plaintext given the cryptogram. While the encrypter aims at maximizing the guessing effort, the wiretapper strives to minimize it, e.g., by ordering guesses acco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reflection coefficients of band-limited spectra and band-limited spectrum modeling

    Publication Year: 1999, Page(s):2030 - 2038
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    We study the properties of the reflection coefficients of band-limited spectra. We show that they must belong to simple subsets of the unit disk. Then, the problem of band-limited spectrum modeling is addressed in a more appropriate way than with approaches based on correlation coefficients. In particular, we derive a new band-limited spectrum model for band-limited signals with first correlation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained coding for binary channels with high intersymbol interference

    Publication Year: 1999, Page(s):1777 - 1797
    Cited by:  Papers (43)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Partial-response (PR) signaling is used to model communications channels with intersymbol interference (ISI) such as the magnetic recording channel and the copper-wire channel for digital subscriber lines. Coding for improving noise immunity in higher order partial-response channels, such as the “extended” class-4 channels denoted EPR4, E2PR4, E3PR4, has become an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of cyclic codes over F2+uF2

    Publication Year: 1999, Page(s):2148 - 2157
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    We give a simple decoding algorithm to decode linear cyclic codes of odd length over the ring R=F2+uF2={0,1,u,u¯=u+1}, where u2=0. A spectral representation of the cyclic codes over R is given and a BCH-like bound is given for the Lee distance of the codes. The ring R shares many properties of Z4 and F4 and admits a linear “Gray map... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An enumerative method for runlength-limited codes: permutation codes

    Publication Year: 1999, Page(s):2199 - 2204
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Permutation codes, introduced by Slepian (1965), were shown to perform well on an additive white Gaussian noise (AWGN) channel. Unfortunately, these codes required large lookup tables, making them quite complex to implement even though the maximum-likelihood decoder is very simple. In this correspondence, we present an enumeration scheme which encodes and decodes permutation codes with low complex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the rate-distortion function of random vectors and stationary sources with mixed distributions

    Publication Year: 1999, Page(s):2110 - 2115
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    The asymptotic (small distortion) behavior of the rate-distortion function of an n-dimensional source vector with mixed distribution is derived. The source distribution is a finite mixture of components such that under each component distribution a certain subset of the coordinates have a discrete distribution while the remaining coordinates have a joint density. The expected number of coordinates... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The shortest common superstring problem: average case analysis for both exact and approximate matching

    Publication Year: 1999, Page(s):1867 - 1886
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    The shortest common superstring problem and its extension to approximate matching are considered in the probability model where each string in a given set has the same length and letters of strings are drawn independently from a finite set. In the exact matching case, several algorithms proposed in the literature are shown to be asymptotically optimal in the sense that the ratio of the savings res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On relations between covering radius and dual distance

    Publication Year: 1999, Page(s):1808 - 1816
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The covering radius of a code tells us how far in the sense of Hamming distance an arbitrary word of the ambient space can be from the code. For a few decades this parameter has been widely studied. We estimate the covering ratios of a code when the dual distance is known. We derive a new bound on covering radii of linear codes. It improves essentially on the previously known estimates in a certai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonbinary quantum codes

    Publication Year: 1999, Page(s):1827 - 1832
    Cited by:  Papers (116)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB)

    We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than two states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional global symmetries. From this standpoint, the analogs of Calderbank-Shor-Steane codes and of GF(4)-linear codes turn out to be special cases of the same construc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discrete multi-Gabor expansions

    Publication Year: 1999, Page(s):1954 - 1967
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    A discrete multi-Gabor expansion (DMGE) is developed to meet the requirements of localized and refined time-frequency (TF) representation of signals. The DMGE uses multiple windows and their translations and complex modulations as synthesis (or analysis) waveforms. It includes and generalizes the metaplectic (translation, modulation, and dilation) representations which are useful in signal analysi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity

    Publication Year: 1999, Page(s):1845 - 1859
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    This paper addresses the problem of designing interleavers for parallel concatenated convolutional codes (PCCCs) tailored to specific constituent codes. We start by establishing the role of the interleaver in the PCCC and the various parameters that influence the performance of the PCCC with a given interleaver. Subsequently, we define a canonical form of the interleaving engine denoted as the fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient homophonic coding

    Publication Year: 1999, Page(s):2083 - 2091
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    Homophonic coding, or homophonic substitution, is referred to as a technique that contributes to reliability of the secret key cipher systems. Its main goal is to convert the plaintext into a sequence of completely random (equiprobable and independent) code letters. In solving this problem three characteristics are to be considered: (i) redundancy, defined as the difference between the mean codewo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hadamard transforms of three-term sequences

    Publication Year: 1999, Page(s):2059 - 2060
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    Certain three-term sequences of period 2n-l are conjectured to have the two-level autocorrelation property. In this note, a formula involving Hadamard transforms of three-term sequences is presented. Its validity has been verified by computer on the range of 5⩽n⩽23 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New binary linear codes which are dual transforms of good codes

    Publication Year: 1999, Page(s):2136 - 2137
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    If C is a binary linear code, one may choose a subset S of C, and form a new code CST which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for picking S, we obtain codes with record-breaking parameters [92,8,44], [105,8,50], [... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the constructions of new resilient functions from old ones

    Publication Year: 1999, Page(s):2077 - 2082
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    Correlation immune functions and resilient functions play important role in cryptography. The concept of correlation immune functions was first introduced and studied by Siegenthaler (1984). Correlation immune functions are used in stream ciphers as combining functions for running-key generators that are resistant to a correlation attack. We present a number of methods for constructing new resilie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal sequences and sum capacity of synchronous CDMA systems

    Publication Year: 1999, Page(s):1984 - 1991
    Cited by:  Papers (228)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The sum capacity of a multiuser synchronous CDMA system is completely characterized in the general case of asymmetric user power constraints-this solves the open problem posed by Rupf and Massey (see ibid., vol.40, p.1261-6, 1994) which had solved the equal power constraint case. We identify the signature sequences with real components that achieve sum capacity and indicate a simple recursive algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of some channels with channel state information

    Publication Year: 1999, Page(s):2007 - 2019
    Cited by:  Papers (283)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    We study the capacity of some channels whose conditional output probability distribution depends on a state process independent of the channel input and where channel state information (CSI) signals are available both at the transmitter (CSIT) and at the receiver (CSIR). When the channel state and the CSI signals are jointly independent and identically distributed (i.i.d.), the channel reduces to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes over rings from curves of higher genus

    Publication Year: 1999, Page(s):1768 - 1776
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    We construct certain error-correcting codes over finite rings and estimate their parameters. These codes are constructed using plane curves and the estimates for their parameters rely on constructing “lifts” of these curves and then estimating the size of certain exponential sums View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel simulation by interval algorithm: a performance analysis of interval algorithm

    Publication Year: 1999, Page(s):2121 - 2129
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    This article deals with the problem of simulating a discrete memoryless channel and proposes two algorithms for channel simulation by using the interval algorithm. The first algorithm provides exact channel simulation and the number of fair random bits per input sample approaches the conditional resolvability of the channel with probability one. The second algorithm provides approximate channel si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined compression and classification with learning vector quantization

    Publication Year: 1999, Page(s):1911 - 1920
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Combined compression and classification problems are becoming increasingly important in many applications with large amounts of sensory data and large sets of classes. These applications range from automatic target recognition (ATR) to medical diagnosis, speech recognition, and fault detection and identification in manufacturing systems. In this paper, we develop and analyze a learning vector quan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Golay convolutional code-some application aspects

    Publication Year: 1999, Page(s):2191 - 2199
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The Golay convolutional code and related block codes are investigated from an application point of view. We calculate the distance spectrum of the Golay convolutional code and the weight distributions of the block codes using the transfer-matrix method. The performance of the considered codes is shown and discussed. Moreover, the codes are applied as component codes of parallel concatenated codes ... 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