By Topic

IEEE Transactions on Information Theory

Issue 10 • Oct. 2005

Filter Results

Displaying Results 1 - 25 of 35
  • Table of contents

    Publication Year: 2005, 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: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Linear-time encodable/decodable codes with near-optimal rate

    Publication Year: 2005, Page(s):3393 - 3400
    Cited by:  Papers (20)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    We present an explicit construction of linear-time encodable and decodable codes of rate r which can correct a fraction (1-r-ε)/2 of errors over an alphabet of constant size depending only on ε, for every 00. The error-correction performance of these codes is optimal as seen by the Singleton bound (these are "near-MDS" codes). Such near-MDS linear-time c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattices which are good for (almost) everything

    Publication Year: 2005, Page(s):3401 - 3416
    Cited by:  Papers (181)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    We define an ensemble of lattices, and show that for asymptotically high dimension most of its members are simultaneously good as sphere packings, sphere coverings, additive white Gaussian noise (AWGN) channel codes and mean-squared error (MSE) quantization codes. These lattices are generated by applying Construction A to a random linear code over a prime field of growing size, i.e., by "lifting" ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A close-to-capacity dirty paper coding scheme

    Publication Year: 2005, Page(s):3417 - 3432
    Cited by:  Papers (153)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (758 KB) | HTML iconHTML

    The "writing on dirty paper"-channel model offers an information-theoretic framework for precoding techniques for canceling arbitrary interference known at the transmitter. It indicates that lossless precoding is theoretically possible at any signal-to-noise ratio (SNR), and thus dirty-paper coding may serve as a basic building block in both single-user and multiuser communication systems. We desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sufficient conditions for existence of binary fix-free codes

    Publication Year: 2005, Page(s):3433 - 3444
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    Two sufficient conditions are given for the existence of binary fix-free codes (i.e., both prefix-free and suffix-free). Let L be a finite multiset of positive integers whose Kraft sum is at most 3/4. It is shown that there exists a fix-free code whose codeword lengths are the elements of L if either of the following two conditions holds: i) The smallest integer in L is at least 2, and no integer ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sphere-packing bounds in the Grassmann and Stiefel manifolds

    Publication Year: 2005, Page(s):3445 - 3456
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block codes this leads to a monotonically increasing minimal distance lower bound as a function of the block length. This advocates large block lengths for the code des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized coset codes for distributed binning

    Publication Year: 2005, Page(s):3457 - 3474
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB) | HTML iconHTML

    In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into bins) of a collection of quantizers associated with a group of source encoders. Further, computationally efficient procedures to index these bins are also required. In this work, we consider a constructive approach for distributed binning in an algebraic framework. Several ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signature optimization for CDMA with limited feedback

    Publication Year: 2005, Page(s):3475 - 3492
    Cited by:  Papers (70)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    We study the performance of joint signature-receiver optimization for direct-sequence code-division multiple access (DS-CDMA) with limited feedback. The receiver for a particular user selects the signature from a signature codebook, and relays the corresponding B index bits to the transmitter over a noiseless channel. We study the performance of a random vector quantization (RVQ) scheme in which t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of linear reduced-rank multistage receivers for DS-CDMA in frequency-selective fading channels

    Publication Year: 2005, Page(s):3493 - 3517
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (825 KB) | HTML iconHTML

    The performance of a set of linear reduced-rank multistage filter banks is studied in the context of multiuser detection for direct-sequence (DS) code-division multiple-access (CDMA) systems. The set of filter banks under consideration is comprised of the minimum mean-square error (MMSE), the minimum output energy (MOE), the best linear unbiased estimator (BLUE), and the maximum-likelihood (ML) de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source-channel diversity for parallel channels

    Publication Year: 2005, Page(s):3518 - 3539
    Cited by:  Papers (99)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    We consider transmitting a source across a pair of independent, nonergodic channels with random states (e.g., slow-fading channels) so as to minimize the average distortion. The general problem is unsolved. Hence, we focus on comparing two commonly used source and channel encoding systems which correspond to exploiting diversity either at the physical layer through parallel channel coding or at th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transmitting to colocated users in wireless ad hoc and sensor networks

    Publication Year: 2005, Page(s):3540 - 3563
    Cited by:  Papers (43)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    We consider wireless ad hoc networks and sensor networks where a remotely located source is transmitting information to a destined user embedded within a group of K densely packed physically colocated users enjoying favorable signal-to-noise ratio (SNR) conditions among themselves, but suffering from quasi-static flat Rayleigh fading with respect to the source. Stringent delay constraints require ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized estimation in an inhomogeneous sensing environment

    Publication Year: 2005, Page(s):3564 - 3575
    Cited by:  Papers (151)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (364 KB) | HTML iconHTML

    We consider decentralized estimation of a noise-corrupted deterministic parameter by a bandwidth-constrained sensor network with a fusion center. The sensor noises are assumed to be additive, zero mean, spatially uncorrelated, but otherwise unknown and possibly different across sensors due to varying sensor quality and inhomogeneous sensing environment. The classical best linear unbiased estimator... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalent models for queueing analysis of deterministic service time tree networks

    Publication Year: 2005, Page(s):3576 - 3584
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In this correspondence, we analyze feedforward tree networks of queues serving fixed-length packets. Using sample path conservation properties and stochastic coupling techniques, we analyze these systems without making any assumptions about the nature of the underlying input processes. In the case when the server rate is the same for all queues, the exact packet occupancy distribution in any queue... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On distances in uniformly random networks

    Publication Year: 2005, Page(s):3584 - 3586
    Cited by:  Papers (247)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (147 KB) | HTML iconHTML

    The distribution of Euclidean distances in Poisson point processes is determined. The main result is the density function of the distance to the n-nearest neighbor of a homogeneous process in Ropfm, which is shown to be governed by a generalized Gamma distribution. The result has many implications for large wireless networks of randomly distributed nodes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the filtering problem for stationary random Z2-fields

    Publication Year: 2005, Page(s):3586 - 3593
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    It is shown that whenever a stationary random field (Zn,m)n,m∈z is given by a Borel function f:Rz × Rz → R of two stationary processes (Xn)n∈z and (Ym)m∈z i.e., then (Zn, m) = (f((Xn+k)kεz, (Ym + ℓ )ℓ εz)) und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified approach to linear estimation problems for nonstationary processes

    Publication Year: 2005, Page(s):3594 - 3601
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    The linear least mean-square (LLMS) error estimation problem of a nonstationary signal corrupted by additive white noise is studied. The formulation of the problem is very general, in the sense that it deals with different estimation problems (smoothing, filtering, and prediction) involving correlation between the signal and the white noise and the possibility of estimating a linear operation (in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovery of exact sparse representations in the presence of bounded noise

    Publication Year: 2005, Page(s):3601 - 3608
    Cited by:  Papers (131)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (270 KB) | HTML iconHTML

    The purpose of this contribution is to extend some recent results on sparse representations of signals in redundant bases developed in the noise-free case to the case of noisy observations. The type of question addressed so far is as follows: given an (n,m)-matrix A with m>n and a vector b=Axo, i.e., admitting a sparse representation xo, find a sufficient condition for b t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian class multivariate Weibull distributions: theory and applications in fading channels

    Publication Year: 2005, Page(s):3608 - 3619
    Cited by:  Papers (130)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    Ascertaining on the suitability of the Weibull distribution to model fading channels, a theoretical framework for a class of multivariate Weibull distributions, originated from Gaussian random processes, is introduced and analyzed. Novel analytical expressions for the joint probability density function (pdf), moment-generating function (mgf), and cumulative distribution function (cdf) are derived ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Antenna selection for unitary space-time modulation

    Publication Year: 2005, Page(s):3620 - 3631
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB) | HTML iconHTML

    This correspondence studies receive antenna selection (AS) for multiple-antenna systems that employ unitary space-time (ST) signals, where the channel state information (CSI) is known neither at the transmitter nor at the receiver. Without CSI at the receiver, we perform AS only at the receiver and the selection is based on a maximum-norm criterion, i.e., a subset of receive antennas that have the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The collision channel with recovery

    Publication Year: 2005, Page(s):3631 - 3638
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    We consider a simple conceptual model of random accessing to a receiver deploying multiuser detection techniques. The model is a simple extension of Massey and Mathys' collision channel without feedback in which a certain probability of recovery from collision is introduced. As the main result, we derive the slot-synchronized capacity region of this recovery channel and show that for sufficiently ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On uniqueness Theorems for Tsallis entropy and Tsallis relative entropy

    Publication Year: 2005, Page(s):3638 - 3645
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    The uniqueness theorem for Tsallis entropy was presented in H. Suyari, IEEE Trans. Inf. Theory, vol. 50, pp. 1783-1787, Aug. 2004 by introducing the generalized Shannon-Khinchin axiom. In the present correspondence, this result is generalized and simplified as follows: Generalization : The uniqueness theorem for Tsallis relative entropy is shown by means of the generalized Hobson's axiom. Simplifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-density parity-check matrices for coding of correlated sources

    Publication Year: 2005, Page(s):3645 - 3654
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    Linear codes for a coding problem of correlated sources are considered. It is proved that we can construct codes by using low-density parity-check (LDPC) matrices with maximum-likelihood (or typical set) decoding. As applications of the above coding problem, a construction of codes is presented for multiple-access channel with correlated additive noises and a coding theorem of parity-check codes f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some notes on the two-prime generator of order 2

    Publication Year: 2005, Page(s):3654 - 3657
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    The two-prime generator of order 2 has several desirable randomness properties if the two primes are chosen properly. In particular, Ding deduced exact formulas for the (periodic) autocorrelation and the linear complexity of these sequences. In this note, we analyze parts of the period of the two-prime generator of order 2 and obtain bounds on the aperiodic autocorrelation and linear complexity pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of optimum binary message-passing decoders

    Publication Year: 2005, Page(s):3658 - 3665
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    We consider a class of message-passing decoders for low-density parity-check (LDPC) codes whose messages are binary valued. We prove that if the channel is symmetric and all codewords are equally likely to be transmitted, an optimum decoding rule (in the sense of minimizing message error rate) should satisfy certain symmetry and isotropy conditions. Using this result, we prove that Gallager's Algo... 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