By Topic

Information Theory, IEEE Transactions on

Issue 6 • Date Jun 2002

Filter Results

Displaying Results 1 - 25 of 35
  • Writing sequences on the plane

    Publication Year: 2002 , Page(s): 1344 - 1354
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | 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.
  • Shannon theory: perspective, trends, and applications special issue dedicated to aaron d. wyner

    Publication Year: 2002 , Page(s): 1237 - 1242
    Save to Project icon | Request Permissions | 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.
  • Filter bank frame expansions with erasures

    Publication Year: 2002 , Page(s): 1439 - 1450
    Cited by:  Papers (48)  |  Patents (1)
    Save to Project icon | Request Permissions | 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.
  • Computing the performance of unitary space-time group codes from their character table

    Publication Year: 2002 , Page(s): 1355 - 1371
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | 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.
  • Spectral efficiency in the wideband regime

    Publication Year: 2002 , Page(s): 1319 - 1343
    Cited by:  Papers (508)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (766 KB) |  | HTML iconHTML  

    The tradeoff of spectral efficiency (b/s/Hz) versus energy-per-information bit is the key measure of channel capacity in the wideband power-limited regime. This paper finds the fundamental bandwidth-power tradeoff of a general class of channels in the wideband regime characterized by low, but nonzero, spectral efficiency and energy per bit close to the minimum value required for reliable communica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Everlasting security in the bounded storage model

    Publication Year: 2002 , Page(s): 1668 - 1680
    Cited by:  Papers (22)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (530 KB) |  | HTML iconHTML  

    We address the problem of the-security of cryptographic protocols in face of future advances in computing technology and algorithmic research. The problem stems from the fact may be deemed that computations which at a given point in time may be deemed infeasible, can, in the course of years or decades, be made possible with improved hardware and/or breakthroughs in code-breaking algorithms. In suc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source coding, large deviations, and approximate pattern matching

    Publication Year: 2002 , Page(s): 1590 - 1615
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (872 KB) |  | HTML iconHTML  

    We present a development of parts of rate-distortion theory and pattern-matching algorithms for lossy data compression, centered around a lossy version of the asymptotic equipartition property (AEP). This treatment closely parallels the corresponding development in lossless compression, a point of view that was advanced in an important paper of Wyner and Ziv in 1989. In the lossless case, we revie... 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 (39)  |  Patents (1)
    Save to Project icon | Request Permissions | 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.
  • Optimal sequences for CDMA under colored noise: a Schur-saddle function property

    Publication Year: 2002 , Page(s): 1295 - 1318
    Cited by:  Papers (45)
    Save to Project icon | Request Permissions | 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.
  • A model for stock price fluctuations based on information

    Publication Year: 2002 , Page(s): 1372 - 1378
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | 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.
  • Gambling for the mnemonically impaired

    Publication Year: 2002 , Page(s): 1379 - 1392
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (548 KB) |  | HTML iconHTML  

    We obtain asymptotically tight bounds on the maximum amount of information that a single bit of memory can retain about the entire past. At each of n successive epochs, a single fair bit is generated and a one-bit memory is updated according to a family of memory update rules (possibly probabilistic and time-dependent) depending only on the value of the new input bit and on the current state of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large-scale typicality of Markov sample paths and consistency of MDL order estimators

    Publication Year: 2002 , Page(s): 1616 - 1628
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (549 KB) |  | HTML iconHTML  

    For Markov chains of arbitrary order, with finite alphabet A, almost sure sense limit theorems are proved on relative frequencies of k-blocks, and of symbols preceded by a given k-block, when k is permitted to grow as the sample size n grows. As-an application, the-consistency of two kinds of minimum description length (MDL) Markov order estimators is proved, with upper bound o(log n), respectivel... 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 (28)
    Save to Project icon | Request Permissions | 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.
  • 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)
    Save to Project icon | Request Permissions | 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.
  • The pros and cons of democracy

    Publication Year: 2002 , Page(s): 1721 - 1725
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | 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.
  • Nested linear/lattice codes for structured multiterminal binning

    Publication Year: 2002 , Page(s): 1250 - 1276
    Cited by:  Papers (329)  |  Patents (31)
    Save to Project icon | Request Permissions | 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.
  • On the reliability exponent of the exponential timing channel

    Publication Year: 2002 , Page(s): 1681 - 1689
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | 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.
  • Quantum rate-distortion theory for memoryless sources

    Publication Year: 2002 , Page(s): 1580 - 1589
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | 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.
  • Feedback strategies for white Gaussian interference networks

    Publication Year: 2002 , Page(s): 1423 - 1438
    Cited by:  Papers (62)
    Save to Project icon | Request Permissions | 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.
  • Scalar versus vector quantization: worst case analysis

    Publication Year: 2002 , Page(s): 1393 - 1409
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (519 KB) |  | HTML iconHTML  

    We study the potential merits of vector quantization and show that there can be an arbitrary discrepancy between the worst case rates required for scalar and vector quantization. Specifically, we describe a random variable and a distortion measure where quantization of a single instance to within a given distortion requires an arbitrarily large number of bits in the worst case, but quantization of... 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 (50)  |  Patents (10)
    Save to Project icon | Request Permissions | 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.
  • The Gaussian watermarking game

    Publication Year: 2002 , Page(s): 1639 - 1667
    Cited by:  Papers (108)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (995 KB) |  | HTML iconHTML  

    Watermarking models a copyright protection mechanism where an original source sequence or "covertext" is modified before distribution to the public in order to embed some extra information. The embedding should be transparent (i.e., the modified data sequence or "stegotext" should be similar to the covertext) and robust (i.e., the extra information should be recoverable even if the stegotext is mo... 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 (99)  |  Patents (3)
    Save to Project icon | Request Permissions | 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.
  • Universal codes for finite sequences of integers drawn from a monotone distribution

    Publication Year: 2002 , Page(s): 1713 - 1720
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | 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.
  • Error exponents of expander codes

    Publication Year: 2002 , Page(s): 1725 - 1729
    Cited by:  Papers (37)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (298 KB) |  | HTML iconHTML  

    We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and the channel capacity. The decoding complexity grows linearly with the code length 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