IEEE Transactions on Information Theory

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
  • 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.
  • 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 (32)  |  Patents (1)
    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.
  • The piling-up approximation in linear cryptanalysis

    Publication Year: 2001, Page(s):2812 - 2823
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    One of the key identities in linear cryptanalysis is the piling-up lemma, which allows one to compute the probability distribution of a sum modulo 2 of binary random variables, when the probability that these are zero is known. However, the lemma holds only for independent random variables. In linear cryptanalysis, one often (mis)uses this identity without knowing whether the random variables are ... 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 (6)
    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.
  • 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.
  • 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.
  • 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.
  • Space-time autocoding

    Publication Year: 2001, Page(s):2761 - 2781
    Cited by:  Papers (58)  |  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.
  • 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.
  • On the cost of worst case coding length constraints

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

    We investigate the redundancy that arises from adding a worst case length constraint to uniquely decodable fixed-to-variable codes over achievable Huffman (1952) codes. This is in contrast to the traditional metric of the redundancy over the entropy. We show that the cost for adding constraints on the worst case coding length is small, and that the resulting bound is related to the Fibonacci numbe... 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 (85)
    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.
  • 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.
  • On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems

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

    The upper bound derived by Verdu (1986) is often used to evaluate the bit error performance of both the maximum-likelihood (ML) sequence detector for single-user systems and the ML multiuser detector for code-division multiple-access (CDMA) systems. This upper bound, which is based on the concept of indecomposable error vectors (IEVs), can be expensive to compute because in general the IEVs may on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial analysis of the minimum distance of turbo codes

    Publication Year: 2001, Page(s):2737 - 2750
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (519 KB) | HTML iconHTML

    In this paper, new upper bounds on the maximum attainable minimum Hamming distance of turbo codes with arbitrary-including the best-interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, the code rate, and the scramblers employed in the encoder. Examples of the new bounds for particular turbo codes are given and discussed. The new bounds a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Thresholding method for dimensionality reduction in recognition systems

    Publication Year: 2001, Page(s):2903 - 2920
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB) | HTML iconHTML

    Often recognition systems must be designed with a relatively small amount of training data. Plug-in test statistics suffer from large estimation errors, often causing the performance to degrade as the measurement vector dimension increases. Choosing a better test statistic or applying a method of dimensionality reduction are two possible solutions to this problem. In this paper, we consider a reco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On inverse problems with unknown operators

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

    Consider a problem of recovery of a smooth function (signal, image) f∈ℱ∈L2([0, 1]d) passed through an unknown filter and then contaminated by a noise. A typical model discussed in the paper is described by a stochastic differential equation dYfε(t)=(Hf)(t)dt+εdW(t), t∈[0, 1]d, ε>0 where H is a linear opera... 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 (183)
    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.
  • 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.
  • 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.
  • Uncertainty principles and ideal atomic decomposition

    Publication Year: 2001, Page(s):2845 - 2862
    Cited by:  Papers (742)  |  Patents (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB) | HTML iconHTML

    Suppose a discrete-time signal S(t), 0⩽t<N, is a superposition of atoms taken from a combined time-frequency dictionary made of spike sequences 1{t=τ} and sinusoids exp{2πiwt/N}/√N. Can one recover, from knowledge of S alone, the precise collection of atoms going to make up S? Because every discrete-time signal can be represented as a superposition of spikes alone, o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-density parity-check codes based on finite geometries: a rediscovery and new results

    Publication Year: 2001, Page(s):2711 - 2736
    Cited by:  Papers (717)  |  Patents (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (958 KB) | HTML iconHTML

    This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner (1981) graphs have girth 6. Finite-geometry LDPC codes can be decoded in various ways, rangi... 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