IEEE Transactions on Information Theory

Volume 47 Issue 7 • Nov. 2001

Filter Results

Displaying Results 1 - 25 of 44
  • Contributors

    Publication Year: 2001, Page(s):3097 - 3105
    Request permission for commercial reuse | PDF file iconPDF (215 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s):3106 - 3124
    Request permission for commercial reuse | PDF file iconPDF (328 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 2001, Page(s):3124 - 3178
    Request permission for commercial reuse | PDF file iconPDF (564 KB)
    Freely Available from IEEE
  • Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling .II

    Publication Year: 2001, Page(s):2793 - 2806
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (545 KB) | HTML iconHTML

    For pt.I see ibid., vol.47, no.7, p.2782-92 (2001). In this paper we analyze a multilevel coded modulation system using phase-shift keying (PSK) signaling and transmitting over the additive white Gaussian noise (AWGN) channel. We reduce the analysis of the overall system to the analysis of each decoding level, considering them as a set of related channels. The concept of a “genie-aided commu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebraic construction of codes for Slepian-Wolf source networks

    Publication Year: 2001, Page(s):3082 - 3088
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    This article proposes an explicit construction of fixed-length codes for Slepian-Wolf (1973) source networks. The proposed code is linear, and has two-step encoding and decoding procedures similar to the concatenated code used for channel coding. Encoding and decoding of the code can be done in a polynomial order of the block length. The proposed code can achieve arbitrary small probability of err... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling .I

    Publication Year: 2001, Page(s):2782 - 2792
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    An asymptotical analysis and comparison of two coded modulation systems using phase-shift keying (PSK) signaling with the transmission taking place over the additive white Gaussian noise (AWGN) channel is provided. In this paper, bounds for the decoding error probability of conventional coded modulation are derived. Both block and trellis coding are considered. The state-complexity error exponent ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient metering schemes with pricing

    Publication Year: 2001, Page(s):2835 - 2844
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB) | HTML iconHTML

    In order to decide on advertisement fees for Web servers, Naor and Pinkas (see Proc. Advances in Cryptology-EUROCRYPT'98 (Lecture Notes in Computer Science). New York: Springer-Verlag, vol.1403, p.576-590, 1998) introduced metering schemes. They proposed metering schemes in which any server is able to compute a proof to be sent to an audit agency if and only if it has been visited by at least a ce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The worst additive noise under a covariance constraint

    Publication Year: 2001, Page(s):3072 - 3081
    Cited by:  Papers (195)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (551 KB) | HTML iconHTML

    The maximum entropy noise under a lag p autocorrelation constraint is known by Burg's theorem to be the pth order Gauss-Markov process satisfying these constraints. The question is, what is the worst additive noise for a communication channel given these constraints? Is it the maximum entropy noise? The problem becomes one of extremizing the mutual information over all noise processes with covaria... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time autocoding

    Publication Year: 2001, Page(s):2761 - 2781
    Cited by:  Papers (59)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (709 KB) | HTML iconHTML

    Prior treatments of space-time communications in Rayleigh flat fading generally assume that channel coding covers either one fading interval-in which case there is a nonzero “outage capacity”-or multiple fading intervals-in which case there is a nonzero Shannon capacity. However, we establish conditions under which channel codes span only one fading interval and yet are arbitrarily rel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative optimum symbol-by-symbol decoding and fast correlation attacks

    Publication Year: 2001, Page(s):3040 - 3049
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    The relation between fast correlation attacks on stream ciphers based on linear feedback shift registers (LFSRs) and the Hartmann-Rudolph (1976) algorithm for optimal symbol-by-symbol decoding of linear block codes is theoretically investigated. By iterating approximate versions of the HR algorithm, novel iterative probabilistic decoding algorithms for fast correlation attacks are developed. In pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes

    Publication Year: 2001, Page(s):2696 - 2710
    Cited by:  Papers (103)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB) | HTML iconHTML

    We derive both upper and lower bounds on the decoding error probability of maximum-likelihood (ML) decoded low-density parity-check (LDPC) codes. The results hold for any binary-input symmetric-output channel. Our results indicate that for various appropriately chosen ensembles of LDPC codes, reliable communication is possible up to channel capacity. However, the ensemble averaged decoding error p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of redundancy on measurement

    Publication Year: 2001, Page(s):3090 - 3096
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB) | HTML iconHTML

    This article demonstrates that increasing the number of measurements made on a system beyond the minimum (i.e., the number of degrees of freedom in the system) can reduce the effect of measurement errors. The article shows, for three broad classes of measurement problems, that, as the measurement redundancy increases, the residual error falls to a small constant value. Twice the number of degrees ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local linear regression estimation under long-range dependence: strong consistency and rates

    Publication Year: 2001, Page(s):2863 - 2875
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (627 KB) | HTML iconHTML

    We consider the nonparametric estimation of multivariate regression functions and their derivatives for a regression model with long-range dependent errors. We adopt a local linear fitting approach and establish strong consistency and rates for the estimators of the regression function and its derivatives. The rates of convergence depend on the amount of smoothing relative to the strength of the l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating a function from ergodic samples with additive noise

    Publication Year: 2001, Page(s):2895 - 2902
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    We study the problem of estimating an unknown function from ergodic samples corrupted by additive noise. It is shown that one can consistently recover an unknown measurable function in this setting, if the one-dimensional (1-D) distribution of the samples is comparable to a known reference distribution, and the noise is independent of the samples and has known mixing rates. The estimates are appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms to enumerate codewords for DC2-constrained channels

    Publication Year: 2001, Page(s):3020 - 3025
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    We introduce a new method for enumerating codewords that can be applied to DC2-constrained channels. Based on this method, two efficient algorithms for evaluating the number of codewords with specified characteristics are developed. Computer calculation results show that these algorithms are significantly more computationally efficient than other techniques developed to date View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes

    Publication Year: 2001, Page(s):2824 - 2834
    Cited by:  Papers (34)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    Previous literature presents several seemingly different approaches to rooted-tree-based multicast key distribution schemes that try to minimize the user key storage while providing efficient member deletion. In this paper, we show that the user key storage on rooted trees can be systematically studied using basic concepts from information theory. We show that the rooted-tree-based multicast key d... View full abstract»

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

    Publication Year: 2001, Page(s):3065 - 3072
    Cited by:  Papers (166)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB) | HTML iconHTML

    We define and show how to construct nonbinary quantum stabilizer codes. Our approach is based on nonbinary error bases. It generalizes the relationship between self-orthogonal codes over F4 and binary quantum codes to one between self-orthogonal codes over F(q2 ) and q-ary quantum codes for any prime power q View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the algebraic structure of quasi-cyclic codes .I. Finite fields

    Publication Year: 2001, Page(s):2751 - 2760
    Cited by:  Papers (97)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 KB) | HTML iconHTML

    A new algebraic approach to quasi-cyclic codes is introduced. The key idea is to regard a quasi-cyclic code over a field as a linear code over an auxiliary ring. By the use of the Chinese remainder theorem (CRT), or of the discrete Fourier transform (DFT), that ring can be decomposed into a direct product of fields. That ring decomposition in turn yields a code construction from codes of lower len... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of physical signature authentication

    Publication Year: 2001, Page(s):3034 - 3039
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    In physical signature authentication schemes, a candidate signature presented for authentication is compared to a previous signature measurement. The uniqueness of a signature is a result of a random physical process underlying the signature formation. We model signatures as realizations of random processes with known statistics. Rate functions for the false alarm and miss probabilities are determ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Claude E. Shannon: a retrospective on his life, work, and impact

    Publication Year: 2001, Page(s):2681 - 2695
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    Claude E. Shannon (1948) invented information theory and provided the concepts, insights, and mathematical formulations that now form the basis for modern communication technology. In a surprisingly large number of ways, he enabled the information age. A major part of this influence comes from his two-part monumental 1948 paper, “A Mathematical Theory of Communication.” We attempt here... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A table of upper bounds for binary codes

    Publication Year: 2001, Page(s):3004 - 3006
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    Let A(n, d) denote the maximum possible number of codewords in an (n, d) binary code. We establish four new bounds on A(n, d), namely, A(21, 4)⩽43689, A(22, 4)⩽87378, A(22, 6)⩽6941, and A(23, 4)⩽173491. Furthermore, using previous upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on A(n, d) for all n⩽28. This table ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inequalities between entropy and index of coincidence derived from information diagrams

    Publication Year: 2001, Page(s):2944 - 2960
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (641 KB) | HTML iconHTML

    To any discrete probability distribution P we can associate its entropy H(P)=-Σpi ln pi and its index of coincidence IC(P)=Σpi2. The main result of the paper is the determination of the precise range of the map P→(IC(P), H(P)). The range looks much like that of the map P→(Pmax, H(P)) where Pmax is the maximal p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The iterative turbo decoding algorithm has fixed points

    Publication Year: 2001, Page(s):2993 - 2995
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    It is shown that the iterative decoding algorithm proposed to decode “turbo codes” has fixed points regardless of the specific constituent codes and regardless of the noise variance of the additive white Gaussian noise (AWGN) channel View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric regression estimation using penalized least squares

    Publication Year: 2001, Page(s):3054 - 3058
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    We present multivariate penalized least squares regression estimates. We use Vapnik-Chervonenkis (see Statistical Learning Theory 1998) theory and bounds on the covering numbers to analyze convergence of the estimates. We show strong consistency of the truncated versions of the estimates without any conditions on the underlying distribution View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on the linear complexity of the discrete logarithm in finite fields

    Publication Year: 2001, Page(s):2807 - 2811
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Let p be a prime, r a positive integer, q=pr, and d a divisor of p(q-1). We derive lower bounds on the linear complexity over the residue class ring Zd of a (q-periodic) sequence representing the residues modulo d of the discrete logarithm in Fq . Moreover, we investigate a sequence over Fq representing the values of a certain polynomial over Fq 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