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
  • 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.
  • 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.
  • Construction of fast recovery codes using a new optimal importance sampling method

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

    We introduce the problem of constructing good fast recovery convolutional codes. When the constraint lengths of the candidate codes are long (say more than 12), it is too computationally complex to perform the code search task. Fortunately, we can transform the code construction problem to a problem related to a transient Markov system. We then develop an optimal importance sampling (IS) method to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Vandermonde code construction

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

    We use a Vandermonde matrix to construct a code of length mn from m codes of length n. A distance estimate for the construction is given. When the starting codes are suitable constacyclic codes, the constructed code is cyclic and from this we obtain new cyclic codes. The results generalize those of Hughes (see ibid., vol.46, p.674-80, 2000) on the u+υ|u-υ construction 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.
  • A semidefinite program for distillable entanglement

    Publication Year: 2001, Page(s):2921 - 2933
    Cited by:  Papers (130)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (490 KB) | HTML iconHTML

    We show that the maximum fidelity obtained by a positive partial transpose (p.p.t.) distillation protocol is given by the solution to a certain semidefinite program. This gives a number of new lower and upper bounds on p.p.t. distillable entanglement (and thus new upper bounds on 2-locally distillable entanglement). In the presence of symmetry, the semidefinite program simplifies considerably, bec... 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.
  • 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.
  • 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.
  • On the support of MSE-optimal, fixed-rate, scalar quantizers

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

    This paper determines how the support regions of optimal and asymptotically optimal fixed-rate scalar quantizers (with respect to mean-squared error) depend on the number of quantization points N and the probability density of the variable being quantized. It shows that for asymptotic optimality it is necessary and sufficient that the support region grow fast enough that the outer (or overload) di... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.

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