By Topic

IEEE Transactions on Information Theory

Issue 2 • Feb. 2006

Filter Results

Displaying Results 1 - 25 of 37
  • Table of contents

    Publication Year: 2006, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Uplink-downlink duality via minimax duality

    Publication Year: 2006, Page(s):361 - 374
    Cited by:  Papers (100)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    The sum capacity of a Gaussian vector broadcast channel is the saddle point of a minimax Gaussian mutual information expression where the maximization is over the set of transmit covariance matrices subject to a power constraint and the minimization is over the set of noise covariance matrices subject to a diagonal constraint. This sum capacity result has been proved using two different methods, o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outage analysis of coded cooperation

    Publication Year: 2006, Page(s):375 - 391
    Cited by:  Papers (272)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    Cooperative communication is an emerging paradigm where multiple mobiles share their resources (bandwidth and power) to achieve better overall performance. Coded cooperation is a mechanism where cooperation is combined with-and operates through-channel coding, as opposed to the repetition-based methods. This work develops expressions for outage probability of coded cooperation. In this work, each ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed approaches for exploiting multiuser diversity in wireless networks

    Publication Year: 2006, Page(s):392 - 413
    Cited by:  Papers (72)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB) | HTML iconHTML

    In wireless fading channels, multiuser diversity can be exploited by scheduling users to transmit when their channel conditions are favorable. This leads to a sum throughput that increases with the number of users and, in certain cases, achieves capacity. However, such scheduling requires global knowledge of every user's channel gain, which may be difficult to obtain in some situations. This paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power levels and packet lengths in random multiple access with multiple-packet reception capability

    Publication Year: 2006, Page(s):414 - 420
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    This paper extends our earlier results. We assume that the receiver has the capability of capturing multiple packets so long as the signal-to-interference-plus-noise ratio (SINR) of each packet is above a designed threshold T throughout its transmission period. We prove that, compared with a multiple-power-level system, the single-power-level system in which all nodes transmit at the maximum allow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Aloha protocol for multihop mobile wireless networks

    Publication Year: 2006, Page(s):421 - 436
    Cited by:  Papers (332)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    An Aloha-type access control mechanism for large mobile, multihop, wireless networks is defined and analyzed. This access scheme is designed for the multihop context, where it is important to find a compromise between the spatial density of communications and the range of each transmission. More precisely, the analysis aims at optimizing the product of the number of simultaneously successful trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The fading number of single-input multiple-output fading channels with memory

    Publication Year: 2006, Page(s):437 - 453
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    We derive the fading number of stationary and ergodic (not necessarily Gaussian) single-input multiple-output (SIMO) fading channels with memory. This is the second term, after the double-logarithmic term, of the high signal-to-noise ratio (SNR) expansion of channel capacity. The transmitter and receiver are assumed to be cognizant of the probability law governing the fading but not of its realiza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On error exponents of modulo lattice additive noise channels

    Publication Year: 2006, Page(s):454 - 471
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    Modulo lattice additive noise (MLAN) channels appear in the analysis of structured binning codes for Costa's dirty-paper channel and of nested lattice codes for the additive white Gaussian noise (AWGN) channel. In this paper, we derive a new lower bound on the error exponents of the MLAN channel. With a proper choice of the shaping lattice and the scaling parameter, the new lower bound coincides w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error exponents for AR order testing

    Publication Year: 2006, Page(s):472 - 488
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    This paper is concerned with error exponents in testing problems raised by autoregressive (AR) modeling. The tests to be considered are variants of generalized likelihood ratio testing corresponding to traditional approaches to autoregressive moving-average (ARMA) modeling estimation. In several related problems, such as Markov order or hidden Markov model order estimation, optimal error exponents... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

    Publication Year: 2006, Page(s):489 - 509
    Cited by:  Papers (5265)  |  Patents (117)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB) | HTML iconHTML

    This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f∈CN and a randomly chosen set of frequencies Ω. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set Ω? A typical result of this paper is as follows. Suppose that f is a superposition of |T| s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A globally convergent and consistent method for estimating the shape parameter of a generalized Gaussian distribution

    Publication Year: 2006, Page(s):510 - 527
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (669 KB) | HTML iconHTML

    We propose a novel methodology for estimating the shape parameter of a generalized Gaussian distribution (GGD). This new method is based on a simple estimating equation derived from a convex shape equation. The estimating equation is completely independent of gamma and polygamma functions. Thus, no lookup table, interpolation, or additional subroutine to evaluate these functions are required for r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vectorial Boolean functions and induced algebraic equations

    Publication Year: 2006, Page(s):528 - 537
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB) | HTML iconHTML

    A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework relates to finding algebraic equations induced by vectorial Boolean functions and, in particular, equations of low algebraic degree. The equations may involve only a subset of input variables and may or may not be conditioned on the values of output variables. In addition, the equations may have a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Periodic prefix-synchronized codes: A generating function approach

    Publication Year: 2006, Page(s):538 - 548
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    A generating function method is developed in order to select synchronization markers that maximize the timing span of period-2 periodic prefix-synchronized (PPS) sync-timing coding with small delay. Sync-timing codes are used in situations where conventional data synchronization is required, and data time stamps or time indices are also needed. A PPS code is a sync-timing code in which each encode... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels

    Publication Year: 2006, Page(s):549 - 583
    Cited by:  Papers (148)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB) | HTML iconHTML

    We present an analysis under the iterative decoding of coset low-density parity-check (LDPC) codes over GF(q), designed for use over arbitrary discrete-memoryless channels (particularly nonbinary and asymmetric channels). We use a random- coset analysis to produce an effect that is similar to output symmetry with binary channels. We show that the random selection of the nonzero elements of the GF(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strongly-MDS convolutional codes

    Publication Year: 2006, Page(s):584 - 598
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Maximum-distance separable (MDS) convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper, a class of MDS convolutional codes is introduced whose column distances reach the generalized Singleton bound at the earliest possible instant. Such codes are called strongly-MDS convolutional codes. They also have a maximum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On robust and dynamic identifying codes

    Publication Year: 2006, Page(s):599 - 612
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    A subset C of vertices in an undirected graph G=(V,E) is called a 1-identifying code if the sets I(v)={u∈C:d(u,v)≤1}, v∈V, are nonempty and no two of them are the same set. It is natural to consider classes of codes that retain the identification property under various conditions, e.g., when the sets I(v) are possibly slightly corrupted. We consider two such classes of robust codes. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Niho type cross-correlation functions via dickson polynomials and Kloosterman sums

    Publication Year: 2006, Page(s):613 - 627
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB) | HTML iconHTML

    Suppose that n=2k is even. We study the cross-correlation function between two m-sequences for Niho type decimations d=(2k-1)s+1. We develop a new technique to study the value distribution of these cross-correlation functions, which makes use of Dickson polynomials. As a first application, we derive here the distribution of the six-valued cross-correlation function for s=3 and odd k, up... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel combining and splitting for cutoff rate improvement

    Publication Year: 2006, Page(s):628 - 639
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    The cutoff rate R0(W) of a discrete memoryless channel (DMC) W is often used as a figure of merit alongside the channel capacity C(W). If a channel W is split into two possibly correlated subchannels W1, W2, the capacity function always satisfies C(W1)+C(W2)lesC(W), while there are examples for which R0(W1)+R0(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantizers with uniform decoders and channel-optimized encoders

    Publication Year: 2006, Page(s):640 - 661
    Cited by:  Papers (6)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    Scalar quantizers with uniform decoders and channel-optimized encoders are studied for a uniform source on [0,1] and binary symmetric channels. Two families of affine index assignments are considered: the complemented natural code (CNC), introduced here, and the natural binary code (NBC). It is shown that the NBC never induces empty cells in the quantizer encoder, whereas the CNC can. Nevertheless... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Causal coding of stationary sources and individual sequences with high resolution

    Publication Year: 2006, Page(s):662 - 680
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    In a causal source coding system, the reconstruction of the present source sample is restricted to be a function of the present and past source samples, while the code stream itself may be noncausal and have variable rate. Neuhoff and Gilbert showed that for memoryless sources, optimum performance among all causal source codes is achieved by time-sharing at most two memoryless codes (quantizers) f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near sufficiency of random coding for two descriptions

    Publication Year: 2006, Page(s):681 - 695
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    We give a single-letter outer bound for the two-descriptions problem for independent and identically distributed (i.i.d.) sources that is universally close to the El Gamal and Cover (EGC) inner bound. The gaps for the sum and individual rates using a quadratic distortion measure are upper-bounded by 1.5 and 0.5 bits/sample, respectively, and are universal with respect to the source being encoded a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is the class of cyclic codes asymptotically good?

    Publication Year: 2006, Page(s):696 - 700
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    There is the long-standing question whether the class of cyclic codes is asymptotically good. By an old result of Lin and Weldon, long Bose-Chaudhuri-Hocquenhem (BCH) codes are asymptotically bad. Berman proved that cyclic codes are asymptotically bad if only finitely many primes are involved in the lengths of the codes. We investigate further classes of cyclic codes which also turn out to be asym... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unequal error protection for convolutional codes

    Publication Year: 2006, Page(s):700 - 708
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB) | HTML iconHTML

    In this correspondence, unequal error-correcting capabilities of convolutional codes are studied. For errors in the information symbols and code symbols, the free input- and output-distances, respectively, serve as "unequal" counterparts to the free distance. When communication takes place close to or above the channel capacity the error bursts tend to be long and the free distance is not any long... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On an upper bound for mixed error-correcting codes

    Publication Year: 2006, Page(s):708 - 712
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    A mixed code is an error-correcting code in which different entries of the codewords can be chosen from different alphabets. In this correspondence an upper bound is given for the number of codewords in a mixed code where all the entries can come from distinct alphabets. This bound improves the sphere packing bound in several directions. The result is specialized to a simpler form in the case when... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering