By Topic

Information Theory, IEEE Transactions on

Issue 7 • Date July 2003

Filter Results

Displaying Results 1 - 25 of 29
  • A first course in information theory [Book Review]

    Publication Year: 2003, Page(s): 1869
    Request permission for commercial reuse | PDF file iconPDF (155 KB) | HTML iconHTML
    Freely Available from IEEE
  • Contributors

    Publication Year: 2003, Page(s):1870 - 1875
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Codecell convexity in optimal entropy-constrained vector quantization

    Publication Year: 2003, Page(s):1821 - 1828
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB) | HTML iconHTML

    Properties of optimal entropy-constrained vector quantizers (ECVQs) are studied for the squared-error distortion measure. It is known that restricting an ECVQ to have convex codecells may preclude its optimality for some sources with discrete distribution. We show that for sources with continuous distribution, any finite-level ECVQ can be replaced by another finite-level ECVQ with convex codecells... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deviation bounds for wavelet shrinkage

    Publication Year: 2003, Page(s):1851 - 1858
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (499 KB) | HTML iconHTML

    We analyze the wavelet shrinkage algorithm of Donoho and Johnstone (1994) in order to assess the quality of the reconstruction of a signal obtained from noisy samples. We give a deviation estimate for the maximum squared error (and, consequently, for the average squared error), under the assumption that the signal comes from a Holder class, and the noise samples are independent, of zero mean, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the stability of distributed sequence adaptation for cellular asynchronous DS-CDMA systems

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

    We consider the sequence adaptation problem for cellular asynchronous code-division multiple-access (CDMA) systems. A game-theoretic approach is used to investigate the stability issues of distributed adaptation algorithms. It is shown that the Nash equilibrium may not exist for cellular CDMA systems if the traditional interference measure is used. In turn we propose a new interference measure whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new metric for probability distributions

    Publication Year: 2003, Page(s):1858 - 1860
    Cited by:  Papers (82)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (243 KB) | HTML iconHTML

    We introduce a metric for probability distributions, which is bounded, information-theoretically motivated, and has a natural Bayesian interpretation. The square root of the well-known χ2 distance is an asymptotic approximation to it. Moreover, it is a close relative of the capacitory discrimination and Jensen-Shannon divergence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near-ellipsoidal Voronoi coding

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

    We consider a special case of Voronoi coding, where a lattice Λ in Rn is shaped (or truncated) using a lattice Λ'={(m1x1,...,mnxn)|(x1,...,xn)∈Λ} for a fixed m_=(m1,...,mn)∈(N/{0,1})n. Using this technique, the shaping boundary is near-ellipsoidal. It is show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Covering codes with improved density

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

    We prove a general recursive inequality concerning μ*(R), the asymptotic (least) density of the best binary covering codes of radius R. In particular, this inequality implies that μ*(R)≤e·(RlogR+logR+loglogR+2), which significantly improves the best known density 2RRR(R+1)/R!. Our inequality also holds for covering codes over arbitrary al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum-diversity transmissions over doubly selective wireless channels

    Publication Year: 2003, Page(s):1832 - 1840
    Cited by:  Papers (103)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB) | HTML iconHTML

    High data rates and multipath propagation give rise to frequency-selectivity of wireless channels, while carrier frequency offsets and mobility-induced Doppler shifts introduce time-selectivity in wireless links. The resulting time- and frequency-selective (or doubly selective) channels offer joint multipath-Doppler diversity gains. Relying on a basis expansion model of the doubly selective channe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uniform power allocation in MIMO channels: a game-theoretic approach

    Publication Year: 2003, Page(s):1707 - 1727
    Cited by:  Papers (78)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1125 KB) | HTML iconHTML

    When transmitting over multiple-input-multiple-output (MIMO) channels, there are additional degrees of freedom with respect to single-input-single-output (SISO) channels: the distribution of the available power over the transmit dimensions. If channel state information (CSI) is available, the optimum solution is well known and is based on diagonalizing the channel matrix and then distributing the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes on graphs: constraint complexity of cycle-free realizations of linear codes

    Publication Year: 2003, Page(s):1597 - 1610
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (782 KB) | HTML iconHTML

    Cycle-free graphical realizations of linear codes generalize trellis realizations. Given a linear code C and a cycle-free graph topology, there exists a well-defined minimal realization for C on that graph in which each constraint is a linear code with a well-defined length and dimension. The constraint complexity of the realization is defined as maximum dimension of any constraint code. There exi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On asymptotic properties of information-theoretic divergences

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

    Mutual asymptotic equivalence is established within three classes of information-theoretic divergences of discrete probability distributions, namely, f-divergences of Csiszar, f-divergences of Bregman, and f-divergences of Burbea-Rao. These equivalences are used to find asymptotic distributions of the corresponding divergence statistics for testing the goodness of fit when the hypothetic distribut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On continuous-time optimal deterministic traffic regulation

    Publication Year: 2003, Page(s):1840 - 1845
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    We study the continuous-time deterministic traffic regulation problem. We propose a regulation form shown to be the optimal deterministic traffic regulator in the sense that it outputs the most packets while satisfying the constraint on the output process. We further investigate the subtle relation between continuous-time and discrete-time optimal deterministic regulators, and reduce our general r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound

    Publication Year: 2003, Page(s):1653 - 1657
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (473 KB) | HTML iconHTML

    In the present paper, we construct a class of nonlinear codes by making use of higher order derivatives of certain functions of algebraic curves. It turns out that the asymptotic bound derived from the Goppa geometry codes can be improved for the entire interval (0,1). In particular, the Tsfasman-Vladut-Zink (TVZ) bound is ameliorated for the entire interval (0,1). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Curves on a sphere, shift-map dynamics, and error control for continuous alphabet sources

    Publication Year: 2003, Page(s):1658 - 1672
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1033 KB) | HTML iconHTML

    We consider two codes based on dynamical systems, for transmitting information from a continuous alphabet, discrete-time source over a Gaussian channel. The first code, a homogeneous spherical code, is generated by the linear dynamical system s˙=As, with A a square skew-symmetric matrix. The second code is generated by the shift map sn=bnsn-1(mod 1). The perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General formulas for capacity of classical-quantum channels

    Publication Year: 2003, Page(s):1753 - 1768
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1477 KB) | HTML iconHTML

    The capacity of a classical-quantum channel (or, in other words, the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds

    Publication Year: 2003, Page(s):1636 - 1652
    Cited by:  Papers (94)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1058 KB) | HTML iconHTML

    We study the limits of performance of Gallager codes (low-density parity-check (LDPC) codes) over binary linear intersymbol interference (ISI) channels with additive white Gaussian noise (AWGN). Using the graph representations of the channel, the code, and the sum-product message-passing detector/decoder, we prove two error concentration theorems. Our proofs expand on previous work by handling com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MMSE whitening and subspace whitening

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

    This correspondence develops a linear whitening transformation that minimizes the mean-squared error (MSE) between the original and whitened data, i.e.,one that results in a white output that is as close as possible to the input, in an MSE sense. When the covariance matrix of the data is not invertible, the whitening transformation is designed to optimally whiten the data on a subspace in which it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New covering codes from an ADS-like construction

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

    A covering code construction is presented. Using this construction it is shown that t[52,39]=3, t[36,21]=4, t[58,32]=7, K(32,2)≤62·218, and K(62,5)≤31·237, where t[n,k] is the minimum covering radius among all binary [n,k] codes and K(n,R) is the minimum cardinality of a binary code of length n and covering radius R. Four new linear codes found by computer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiuser detection for overloaded CDMA systems

    Publication Year: 2003, Page(s):1728 - 1742
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1030 KB) | HTML iconHTML

    Multiuser detection for overloaded code-division multiple-access (CDMA) systems, in which the number of users is larger than the dimension of the signal space, is of particular interest when bandwidth is at a premium. In this paper, certain fundamental questions are answered regarding the asymptotic forms and performance of suboptimum multiuser detectors for cases where the desired and/or interfer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • One-way communication and error-correcting codes

    Publication Year: 2003, Page(s):1781 - 1788
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We establish a further connection between one-way communication where a sender conveys information to a receiver who has related information, and error-correction coding where a sender attempts to communicate reliably over a noisy channel. Using this connection we obtain three results on the two problems. We derive an often-tight lower bound on the number of bits required for one-way communication... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of reproducing kernel spaces in learning theory

    Publication Year: 2003, Page(s):1743 - 1752
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (942 KB) | HTML iconHTML

    The capacity of reproducing kernel Hilbert spaces (RKHS) plays an essential role in the analysis of learning theory. Covering numbers and packing numbers of balls of these reproducing kernel spaces are important measurements of this capacity. We first present lower bound estimates for the packing numbers by means of nodal functions. Then we show that if a Mercer kernel is Cs (for some s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parity-check density versus performance of binary linear block codes over memoryless symmetric channels

    Publication Year: 2003, Page(s):1611 - 1635
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1564 KB) | HTML iconHTML

    We derive lower bounds on the density of parity-check matrices of binary linear codes which are used over memoryless binary-input output-symmetric (MBIOS) channels. The bounds are expressed in terms of the gap between the rate of these codes for which reliable communications is achievable and the channel capacity; they are valid for every sequence of binary linear block codes if there exists a dec... 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 over Gaussian channels with erasures

    Publication Year: 2003, Page(s):1801 - 1809
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (687 KB) | HTML iconHTML

    We consider low-density parity-check code (LDPCC) design for additive white Gaussian noise (AWGN) channels with erasures. This model, for example, represents a common situation in magnetic and optical recording where defects or thermal asperities in the system are detected and presented to the decoder as erasures. We give thresholds of regular and irregular LDPCCs and discuss practical code design... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data verification and reconciliation with generalized error-control codes

    Publication Year: 2003, Page(s):1788 - 1793
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    We consider the problem of data reconciliation, which we model as two separate multisets of data that must be reconciled with minimum communication. Under this model, we show that the problem of reconciliation is equivalent to a variant of the graph coloring problem and provide consequent upper and lower bounds on the communication complexity of reconciliation. Further, we show by means of an expl... 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