IEEE Transactions on Information Theory

Issue 6 • June 2003

Filter Results

Displaying Results 1 - 24 of 24
  • Contributors

    Publication Year: 2003, Page(s):1592 - 1595
    Request permission for commercial reuse | PDF file iconPDF (169 KB)
    Freely Available from IEEE
  • Weight distributions of cyclic self-dual codes

    Publication Year: 2003, Page(s):1582 - 1591
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1278 KB) | HTML iconHTML

    We give a 1-level squaring construction for binary repeated-root cyclic codes of length n=2ab, a≥1, b odd. This allows us to obtain the weight distributions of all cyclic binary self-dual codes of lengths up to 110, which are not accessible by direct computation. We also use the shadow construction, as a particular method for Type I self-dual codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optical intensity-modulated direct detection channels: signal space and lattice codes

    Publication Year: 2003, Page(s):1385 - 1399
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1574 KB) | HTML iconHTML

    Traditional approaches to constructing constellations for electrical channels cannot be applied directly to the optical intensity channel. This work presents a structured signal space model for optical intensity channels where the nonnegativity and average amplitude constraints are represented geometrically. Lattice codes satisfying channel constraints are defined and coding and shaping gain relat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extensions of the method of poles for code construction

    Publication Year: 2003, Page(s):1516 - 1523
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    The method of poles is a method introduced by Franaszek (1969) for constructing a rate-1:1 finite-state code from k-ary data into a constrained channel of finite type whose capacity is strictly greater than log(k). The method is based on the computation of a set of states called poles. With each pole is associated a set of paths going from this pole to others. Each set verifies an entropy conditio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sparse representation in pairs of bases

    Publication Year: 2003, Page(s):1579 - 1581
    Cited by:  Papers (68)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l0 optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences

    Publication Year: 2003, Page(s):1548 - 1552
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    In this article, the linear complexity over Fp of Lempel-Cohn-Eastman (1977) sequences of period pm-1 for an odd prime p is determined. For p=3,5, and 7, the exact closed-form expressions for the linear complexity over Fp of LCE sequences of period pm-1 are derived. Further, the trace representations for LCE sequences of period pm-1 for p=3 an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information projections revisited

    Publication Year: 2003, Page(s):1474 - 1490
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1589 KB) | HTML iconHTML

    The goal of this paper is to complete results available about I-projections, reverse I-projections, and their generalized versions, with focus on linear and exponential families. Pythagorean-like identities and inequalities are revisited and generalized, and generalized maximum-likelihood (ML) estimates for exponential families are introduced. The main tool is a new concept of extension of exponen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On low-complexity space-time coding for quasi-static channels

    Publication Year: 2003, Page(s):1400 - 1416
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (989 KB) | HTML iconHTML

    We propose a new space-time coding scheme for the quasi-static multiple-antenna channel with perfect channel state information at the receiver and no channel state information at the transmitter. In our scheme, codewords produced by a trellis encoder are formatted into space-time codeword arrays such that decoding can be implemented efficiently by minimum mean-square error (MMSE) decision-feedback... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing linear unequal error protection codes from algebraic curves

    Publication Year: 2003, Page(s):1523 - 1526
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    We show that the concept of "generalized algebraic geometry codes" which was introduced by Xing, Niederreiter, and Lam (see ibid., vol.45, p.2498-2501, Nov. 1999) gives a natural framework for constructing linear unequal error protection codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random properties of the highest level sequences of primitive sequences over Z(2e)

    Publication Year: 2003, Page(s):1553 - 1557
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    Using the estimates of the exponential sums over Galois rings, we discuss the random properties of the highest level sequences αe-1 of primitive sequences generated by a primitive polynomial of degree n over Z(2e). First we obtain an estimate of 0, 1 distribution in one period of αe-1. On the other hand, we give an estimate of the absolute value of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refinements of Pinsker's inequality

    Publication Year: 2003, Page(s):1491 - 1498
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (713 KB) | HTML iconHTML

    Let V and D denote, respectively, total variation and divergence. We study lower bounds of D with V fixed. The theoretically best (i.e., largest) lower bound determines a function L=L(V), Vajda's (1970) tight lower bound. The main result is an exact parametrization of L. This leads to Taylor polynomials which are lower bounds for L, and thereby to extensions of the classical Pinsker (1960) inequal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negacyclic codes over Z4 of even length

    Publication Year: 2003, Page(s):1417 - 1424
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (813 KB) | HTML iconHTML

    This paper generalizes the results from Wolfmann (see ibid., vol.45, p.2527-2532, Nov. 1999 and vol.47, p.1773-1779, July 2001), classifying all negacyclic codes over Z4 of even length using a transform approach. It is then shown which linear binary cyclic codes are images of negacyclic codes under the Gray map. In the process, the concatenated structure of both negacyclic codes and bin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Pless-construction and ML decoding of the (48,24,12) quadratic residue code

    Publication Year: 2003, Page(s):1527 - 1535
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (482 KB) | HTML iconHTML

    We present a method for maximum likelihood decoding of the (48,24,12) quadratic residue code. This method is based on projecting the code onto a subcode with an acyclic Tanner graph, and representing the set of coset leaders by a trellis diagram. This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule. We show that unlike the (24,12,8) Gola... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of bandwidth-efficient multiple access to other signal designs for correlated waveform multiple-access communications

    Publication Year: 2003, Page(s):1558 - 1564
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    There have been several papers in the literature that deal with the design of signature waveforms for use by the transmitters in uplink, single-cell, multiple-access communications. In particular, we consider the approach introduced by Guess and Varanasi (1996, 1997), where the signature waveforms are specifically designed for the centralized multiuser receiver at the base so that each transmitter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On multivariate Rayleigh and exponential distributions

    Publication Year: 2003, Page(s):1499 - 1515
    Cited by:  Papers (123)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB) | HTML iconHTML

    In this paper, expressions for multivariate Rayleigh and exponential probability density functions (PDFs) generated from correlated Gaussian random variables are presented. We first obtain a general integral form of the PDFs, and then study the case when the complex Gaussian generating vector is circular. We consider two specific circular cases: the exchangeable case when the variates are evenly c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The serial concatenation of rate-1 codes through uniform random interleavers

    Publication Year: 2003, Page(s):1425 - 1438
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (810 KB) | HTML iconHTML

    Until the analysis of repeat accumulate codes by Divsalar et al. (1998), few people would have guessed that simple rate-1 codes could play a crucial role in the construction of "good" binary codes. We construct "good" binary linear block codes at any rate r<1 by serially concatenating an arbitrary outer code of rate r with a large number of rate-1 inner codes through uniform random interleavers. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-perfect Lee distance codes

    Publication Year: 2003, Page(s):1535 - 1539
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB) | HTML iconHTML

    A construction of perfect/quasiperfect Lee distance codes in ZK2 is introduced. For this class of codes, a constant time encoding scheme is defined, the minimum code distance is derived, and the maximum covering radius is calculated. Efficient decoding schemes are investigated and developed. In general, a code of this class can be decoded in O(t1), where t1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum multiuser noncoherent DPSK detection in generalized diversity Rayleigh-fading channels

    Publication Year: 2003, Page(s):1565 - 1574
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (574 KB) | HTML iconHTML

    The jointly optimum multiuser noncoherent detector for differential phase-shift keying (DPSK) modulation over the generalized diversity Rayleigh-fading (GDRF) channel is derived and analyzed. The GDRF channel includes time/frequency/receiver antenna diversity and allows fading correlations between the various diversity branches of each user. Noncoherent detection here refers to the case where the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-correlation, large linear span sequences from function fields

    Publication Year: 2003, Page(s):1439 - 1446
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (695 KB) | HTML iconHTML

    A general method of generating families of binary sequences with low correlation as well as large linear span is presented. The lower bound on the linear span is on the order of the square root of the period of each sequence within the family. The design makes use of the theory of function fields. Two example applications of this method are presented in which the underlying function fields are the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal quaternary linear rate-1/2 codes of length ≤18

    Publication Year: 2003, Page(s):1540 - 1543
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    We classify all optimal linear [n,n/2,d] codes over F4 up to length 18. In particular, we show that there is a unique optimal [12,6,6] code and three optimal [16,8,7] codes, up to equivalence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate series representations of second-order stochastic processes: applications to signal detection and estimation

    Publication Year: 2003, Page(s):1574 - 1578
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    Two distinct approximate series representations are obtained for the entire class of measurable, second-order stochastic processes defined on any interval of the real line. They include as particular cases all earlier approximate representations based on the Rayleigh-Ritz method. It is also shown that each of them converges with a different type of convergence. Finally, two applications in statist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence analysis of the constant modulus algorithm

    Publication Year: 2003, Page(s):1447 - 1464
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1643 KB) | HTML iconHTML

    We study the global convergence of the stochastic gradient constant modulus algorithm (CMA) in the absence of channel noise as well as in the presence of channel noise. The case of fractionally spaced equalizer and/or multiple antenna at the receiver is considered. For the noiseless case, we show that with proper initialization, and with small step size, the algorithm converges to a zero-forcing f... View full abstract»

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

    Publication Year: 2003, Page(s):1544 - 1547
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB) | HTML iconHTML

    Identifying codes can be used to locate malfunctioning processors. We say that a code C of length n is a linear (1,≤l)-identifying code if it is a subspace of F2n and for all X,Y⊆F2n such that |X|, |Y|≤l and X≠Y, we have ∪x∈X(B(x)∩C)≠∪y∈Y(B(y)∩C). Strongly (1,≤l)-identifying codes are a variant of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of hybrid quantum memory

    Publication Year: 2003, Page(s):1465 - 1473
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (678 KB) | HTML iconHTML

    The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine when N copies of a quantum memory 𝒜 embed in N(1+&ogr;(1)) copies of another quantum memory ℬ. This relationship captures the notion thatℬ is as... 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