Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

IEEE Transactions on Information Theory

Issue 11 • Nov. 2002

Filter Results

Displaying Results 1 - 19 of 19
  • Contributors

    Publication Year: 2002, Page(s):3009 - 3012
    Request permission for commercial reuse | PDF file iconPDF (175 KB)
    Freely Available from IEEE
  • Cryptographic properties of the Welch-Gong transformation sequence generators

    Publication Year: 2002, Page(s):2837 - 2846
    Cited by:  Papers (28)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (397 KB) | HTML iconHTML

    Welch-Gong (WG) transformation sequences are binary sequences of period 2n - 1 with two-level autocorrelation. These sequences were discovered by Golomb, Gong, and Gaal (1998) and they verified the validity of their construction for 5 ⩽ n ⩽ 20. Later, No, Chung, and Yun (1998) found another way to construct the WG sequences and verified their result for 5 ⩽ n ⩽ 20. Dillo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic bounds on frameproof codes

    Publication Year: 2002, Page(s):2991 - 2995
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    We study the asymptotic behavior of frameproof codes. Some lower bounds are derived from the theory of error-correcting codes. In particular, the lower bound obtained directly by applying algebraic-geometry codes is improved by employing the Jacobian group structure of algebraic curves View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

    Publication Year: 2002, Page(s):2817 - 2825
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    Rueppel (1986) conjectured that periodic binary sequences have expected linear complexity close to the period length N. In this paper, we determine the expected value of the linear complexity of N-periodic sequences explicitly and confirm Rueppel's conjecture for arbitrary finite fields. Cryptographically strong sequences should not only have a large linear complexity, but also the change of a few... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet spectrum and its characterization property for random processes

    Publication Year: 2002, Page(s):2922 - 2937
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (614 KB) | HTML iconHTML

    The wavelet spectrum of a random process comprises the variances of the wavelet coefficients of the process computed within each scale. This paper investigates the possibility of using the wavelet spectrum, obtained from a continuous wavelet transform (CWT), to uniquely represent the second-order statistical properties of random processes-particularly, stationary processes and long-memory nonstati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet-based estimators of scaling behavior

    Publication Year: 2002, Page(s):2938 - 2954
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB) | HTML iconHTML

    Various wavelet-based estimators of self-similarity or long-range dependence scaling exponent are studied extensively. These estimators mainly include the (bi)orthogonal wavelet estimators and the wavelet transform modulus maxima (WTMM) estimator. This study focuses both on short and long time-series. In the framework of fractional autoregressive integrated moving average (FARIMA) processes, we ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian source coding with spherical codes

    Publication Year: 2002, Page(s):2980 - 2989
    Cited by:  Papers (38)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    A fixed-rate shape-gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in ℝk-1 onto a sphere in ℝk, and the gain codebook is a globally optimal scalar quantizer. A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio withi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptanalysis of Polly Cracker

    Publication Year: 2002, Page(s):2990 - 2991
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (214 KB) | HTML iconHTML

    An attack on the public key cryptosystem Polly Cracker is described, that reveals the complete secret key σ ∈ Fq n by means of n (nonadaptively) chosen "fake" ciphertexts View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New nonbinary sequences with ideal two-level autocorrelation

    Publication Year: 2002, Page(s):2868 - 2872
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    We find new families of nonbinary sequences of period pn-1 with symbols from a finite field Fp for any prime p⩾3. The sequences have two-level ideal autocorrelation and are generalizations of previously found ternary sequences with ideal autocorrelation. Difference sets with parameters ((pn-1)/(p-1), (pn-1-1)/(p-1), (pn-2-1)/(p-1)) can als... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New bounds for the Marcum Q-function

    Publication Year: 2002, Page(s):3003 - 3008
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB) | HTML iconHTML

    New bounds are proposed for the Marcum Q-function, which is defined by an integral expression where the 0th-order modified Bessel function appears. The proposed bounds are derived by suitable approximations of the 0th-order modified Bessel function in the integration region of the Marcum Q-function. They prove to be very tight and outperform bounds previously proposed in the literature. In particu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytic variations on redundancy rates of renewal processes

    Publication Year: 2002, Page(s):2911 - 2921
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (466 KB) | HTML iconHTML

    Csiszar and Shields (1996) proved that the minimax redundancy for a class of (stationary) renewal processes is Θ(√n) where n is the block length. This interesting result provides a nontrivial bound on redundancy for a nonparametric family of processes. The present paper gives a precise estimate of the redundancy rate for such (nonstationary) renewal sources, namely, 2/(log2)√((&p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstruction of band-limited signals from local averages

    Publication Year: 2002, Page(s):2955 - 2963
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    The sampling theorem says that every band-limited signal is uniquely determined by its sampled values provided the sampling points satisfy certain conditions. However, sampled values obtained in practice may not be the exact values of a signal at sampling points, but only averages of the signal near these points. Grochenig (1992) proved that band-limited signals can be reconstructed exactly from l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of paraunitary filter banks over fields of characteristic two

    Publication Year: 2002, Page(s):2964 - 2979
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (607 KB) | HTML iconHTML

    Motivated by our wavelet framework for error-control coding, we proceed to develop an important family of wavelet transforms over finite fields. Paraunitary (PU) filter banks that are realizations of orthogonal wavelets by multirate filters are an important subclass of perfect reconstruction (PR) filter banks. A parameterization of PU filter banks that covers all possible PU systems is very desira... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case

    Publication Year: 2002, Page(s):2847 - 2867
    Cited by:  Papers (78)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (751 KB) | HTML iconHTML

    New designs for families of sequences over GF(p) with low cross correlation, balance property, and large linear span are presented. The key idea of the new designs is to use short p-ary sequences of period υ with the two-level autocorrelation function together with the interleaved structure to construct a set of long sequences with the desired properties. The resulting sequences are interleav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions of codes from residue rings of polynomials

    Publication Year: 2002, Page(s):2995 - 2997
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB) | HTML iconHTML

    We present one construction for nonlinear codes and one construction for binary constant-weight codes based on residue rings of polynomials. It turns out that the first construction yields nonlinear codes with reasonable parameters, and a bound of Graham and Sloane (1980) is improved by the second construction View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lagrangian empirical design of variable-rate vector quantizers: consistency and convergence rates

    Publication Year: 2002, Page(s):2998 - 3003
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    The Lagrangian formulation of variable-rate vector quantization is known to yield useful necessary conditions for quantizer optimality and generalized Lloyd algorithms for quantizer design. The Lagrangian formulation is demonstrated to provide a convenient framework for analyzing the empirical design of variable-rate vector quantizers. In particular, the consistency of empirical design based on mi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of multiuser detectors for multicasting in wireless ad hoc CDMA networks

    Publication Year: 2002, Page(s):2873 - 2887
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB) | HTML iconHTML

    In this paper, we address the issue of performance of linear multiuser detectors for a multicasting application in an ad hoc wireless network. Using a code-division multiple-access (CDMA) framework, we demonstrate how capacity results for multiuser detectors can be adapted to do session admission control for the multicasting problem. We then develop a multicast routing algorithm for ad hoc wireles... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fibonacci and Galois representations of feedback-with-carry shift registers

    Publication Year: 2002, Page(s):2826 - 2836
    Cited by:  Papers (56)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB) | HTML iconHTML

    A feedback-with-carry shift register (FCSR) with "Fibonacci" architecture is a shift register provided with a small amount of memory which is used in the feedback algorithm. Like the linear feedback shift register (LFSR), the FCSR provides a simple and predictable method for the fast generation of pseudorandom sequences with good statistical properties and large periods. In this paper, we describe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors

    Publication Year: 2002, Page(s):2888 - 2910
    Cited by:  Papers (271)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (745 KB) | HTML iconHTML

    We present a theory, based on statistical mechanics, to evaluate analytically the performance of uncoded, fully synchronous, randomly spread code-division multiple-access (CDMA) multiuser detectors with additive white Gaussian noise (AWGN) channel, under perfect power control, and in the large-system limit. Application of the replica method, a tool developed in the literature of statistical mechan... 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