By Topic

IEEE Transactions on Information Theory

Issue 6 • Date Jun 2002

Filter Results

Displaying Results 1 - 25 of 35
  • Nested linear/lattice codes for structured multiterminal binning

    Publication Year: 2002, Page(s):1250 - 1276
    Cited by:  Papers (418)  |  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    Network information theory promises high gains over simple point-to-point communication techniques, at the cost of higher complexity. However, lack of structured coding schemes limited the practical application of these concepts so far. One of the basic elements of a network code is the binning scheme. Wyner (1974, 1978) and other researchers proposed various forms of coset codes for efficient bin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Opportunistic beamforming using dumb antennas

    Publication Year: 2002, Page(s):1277 - 1294
    Cited by:  Papers (1561)  |  Patents (121)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    Multiuser diversity is a form of diversity inherent in a wireless network, provided by independent time-varying channels across the different users. The diversity benefit is exploited by tracking the channel fluctuations of the users and scheduling transmissions to users when their instantaneous channel quality is near the peak. The diversity gain increases with the dynamic range of the fluctuatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal sequences for CDMA under colored noise: a Schur-saddle function property

    Publication Year: 2002, Page(s):1295 - 1318
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (770 KB) | HTML iconHTML

    We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We consider two types of receiver structures: first we consider the information-theoretically optimal receiver and use the sum capacity of the channel as our performance measure. Second, we consider the linear minimum mean squ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Order estimation for a special class of hidden Markov sources and binary renewal processes

    Publication Year: 2002, Page(s):1704 - 1713
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characterized in terms of equivalent renewal processes. No a priori bound is assumed on the maximum. permissible order. An order estimator based on renewal types is constructed, and is shown to be strongly consistent by computing t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Writing sequences on the plane

    Publication Year: 2002, Page(s):1344 - 1354
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A good arrangement should enable the one-dimensional sequences to be modeled as Markov chains or shifts of finite type. Since this is not possible in general, two-dimensional data is most commonly scanned by rows, columns,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Filter bank frame expansions with erasures

    Publication Year: 2002, Page(s):1439 - 1450
    Cited by:  Papers (58)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB) | HTML iconHTML

    We study frames for robust transmission over the Internet. In our previous work, we used quantized finite-dimensional frames to achieve resilience to packet losses; here, we allow the input to be a sequence in l2(Z) and focus on a filter-bank implementation of the system. We present results in parallel, RN or CN versus l2(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communicating via a processing broadcast satellite

    Publication Year: 2002, Page(s):1243 - 1249
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    Three dependent users are physically separated but communicate with each other via a satellite. Each user generates data which it stores locally. In addition, each user sends a message to the satellite. The satellite processes the messages received from the users and broadcasts one common message to all three users. Each user must be capable of reconstructing the data of the other two users based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the reliability exponent of the exponential timing channel

    Publication Year: 2002, Page(s):1681 - 1689
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (367 KB) | HTML iconHTML

    We determine the reliability exponent E(R) of the Anantharam-Verdu (see ibid., vol.42, p.4-18, Jan.1996) exponential server timing channel with service rate μ for all rates R between a critical rate Rc = (μ/4) log 2 and the channel capacity C = e-1μ. For rates between 0 and Rc, we provide a random-coding lower bound Er(R) and a sphere-packing u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Duality between channel capacity and rate distortion with two-sided state information

    Publication Year: 2002, Page(s):1629 - 1638
    Cited by:  Papers (86)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB) | HTML iconHTML

    We show that the duality between channel capacity and data compression is retained when state information is available to the sender, to the receiver, to both, or to neither. We present a unified theory for eight special cases of channel capacity and rate distortion with state information, which also extends existing results to arbitrary pairs of independent and identically distributed (i.i.d.) co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal codes for finite sequences of integers drawn from a monotone distribution

    Publication Year: 2002, Page(s):1713 - 1720
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (407 KB) | HTML iconHTML

    We offer two noiseless codes for blocks of integers Xn = (X1, ..., Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class of memoryless sources with a possibly infinite alphabet whose marginal distribution is monotone. Specifically, we show that the expected code length L (Xn) of our first universal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing the performance of unitary space-time group codes from their character table

    Publication Year: 2002, Page(s):1355 - 1371
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (687 KB) | HTML iconHTML

    Multiple antennas can greatly increase the data rate and reliability of a wireless communication link in a fading environment. Their success, however, depends on the design of cedes that achieve these promises. It is well known that unitary matrices can be used to design differentially modulated space-time codes. These codes have a particularly efficient description if they form a finite group und... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding theorems for turbo code ensembles

    Publication Year: 2002, Page(s):1451 - 1461
    Cited by:  Papers (47)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB) | HTML iconHTML

    This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense. For a turbo code ensemble defined by a fixed set of component codes (subject only to mild necessary restrictions), there exists a positive number γ0 such that for any binary-input memoryless channel whose Bhattacharyya noi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cayley differential unitary space-time codes

    Publication Year: 2002, Page(s):1485 - 1503
    Cited by:  Papers (130)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (601 KB) | HTML iconHTML

    One method for communicating with multiple antennas is to encode the transmitted data differentially using unitary matrices at the transmitter, and to decode differentially without knowing the channel coefficients at the receiver. Since channel knowledge is not required at the receiver, differential schemes are ideal for use on wireless links where channel tracking is undesirable or infeasible, ei... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for stock price fluctuations based on information

    Publication Year: 2002, Page(s):1372 - 1378
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    The author presents a new model for stock price fluctuations based on a concept of "information." In contrast, the usual Black-Scholes-Merton-Samuelson (1965, 1973) model is based on the explicit assumption that information is uniformly held by everyone and plays no role in stock prices. The new model is based on the evident nonuniformity of information in the market and the evident time delay unt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shannon theory: perspective, trends, and applications special issue dedicated to aaron d. wyner

    Publication Year: 2002, Page(s):1237 - 1242
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (190 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hidden Markov processes

    Publication Year: 2002, Page(s):1518 - 1569
    Cited by:  Papers (244)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1314 KB) | HTML iconHTML

    An overview of statistical and information-theoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discrete-time finite-state homogeneous Markov chain observed through a discrete-time memoryless invariant channel. In recent years, the work of Baum and Petrie (1966) on finite-state finite-alphabet HMPs was expanded to HMPs with finite as well as continuous state spaces and a g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient universal prediction algorithm for unknown sources with limited training data

    Publication Year: 2002, Page(s):1690 - 1693
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    Inspired by C. E. Shannon's celebrated paper: "Prediction and entropy of printed English" (1951), we consider the optimal prediction error for unknown finite-alphabet ergodic Markov sources, for prediction algorithms that make inference about the most probable incoming letter, where the distribution of the unknown source is apparent only via a short training sequence of N + 1 letters. We allow N t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The pros and cons of democracy

    Publication Year: 2002, Page(s):1721 - 1725
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    We introduce the concept of "democracy," in which the individual bits in a coarsely quantized representation of a signal are all given "equal weight" in the approximation to the original signal. We prove that such democratic representations cannot achieve the same accuracy as optimal nondemocratic schemes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomness, arrays, differences and duality

    Publication Year: 2002, Page(s):1698 - 1703
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    Random variables that take on values in the finite field of q elements are considered. It is shown that joint distributions of such random variables are equivalently described by the individual distributions of their linear combinations. Random vectors X that are equally likely to take on any row of an arbitrary q-ary rectangular array as their value are treated extensively, together with the rand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint message-passing decoding of LDPC codes and partial-response channels

    Publication Year: 2002, Page(s):1410 - 1422
    Cited by:  Papers (62)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (483 KB) | HTML iconHTML

    Ideas of message passing are applied to the problem of removing the effects of intersymbol interference (ISI) from partial-response channels. Both bit-based and state-based parallel message-passing algorithms are proposed. For a fixed number of iterations less than the block length, the bit-error rate of the state-based algorithm approaches a nonzero constant as the signal-to-noise ratio (SNR) app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback strategies for white Gaussian interference networks

    Publication Year: 2002, Page(s):1423 - 1438
    Cited by:  Papers (74)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (595 KB) | HTML iconHTML

    A white Gaussian interference network is a channel with T transmitters and R receivers where the received symbols are linear combinations of the transmitted symbols and white Gaussian noise. This paper considers the case where K messages are transmitted through the network in a point-to-point manner, i.e., each message is encoded by exactly one transmitter and is destined for exactly one receiver.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum rate-distortion theory for memoryless sources

    Publication Year: 2002, Page(s):1580 - 1589
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB) | HTML iconHTML

    We formulate quantum rate-distortion theory in the most general setting where classical side information is included in the tradeoff. Using a natural distortion measure based on entanglement fidelity and specializing to the case of an unrestricted classical side channel, we find the exact quantum rate-distortion function for a source of isotropic qubits. An upper bound we believe to be exact is fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-antennas and isotropically random unitary inputs: the received signal density in closed form

    Publication Year: 2002, Page(s):1473 - 1484
    Cited by:  Papers (113)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (486 KB) | HTML iconHTML

    An important open problem in multiple-antenna communications theory is to compute the capacity of a wireless link subject to flat Rayleigh block-fading, with no channel-state information (CSI) available either to the transmitter or to the receiver. The isotropically random (i.r.) unitary matrix-having orthonormal columns, and a probability density that is invariant to premultiplication by an indep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal composite hypothesis testing: a competitive minimax approach

    Publication Year: 2002, Page(s):1504 - 1517
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (498 KB) | HTML iconHTML

    A novel approach is presented for the long-standing problem of composite hypothesis testing. In composite hypothesis testing, unlike in simple hypothesis testing, the probability function of the observed data, given the hypothesis, is uncertain as it depends on the unknown value of some parameter. The proposed approach is to minimize the worst case ratio between the probability of error of a decis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A universal predictor based on pattern matching

    Publication Year: 2002, Page(s):1462 - 1472
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB) | HTML iconHTML

    We consider a universal predictor based on pattern matching. Given a sequence X1, ..., Xn drawn from a stationary mixing source, it predicts the next symbol Xn+1 based on selecting a context of Xn+1. The predictor, called the sampled pattern matching (SPM), is a modification of the Ehrenfeucht-Mycielski (1992) pseudorandom generator algorithm. It predict... 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