IEEE Transactions on Information Theory

Volume 47 Issue 1 • Jan. 2001

Filter Results

Displaying Results 1 - 25 of 51
  • Efficient reconstruction of sequences

    Publication Year: 2001, Page(s):2 - 22
    Cited by:  Papers (49)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB) | HTML iconHTML

    We introduce and solve some new problems of efficient reconstruction of an unknown sequence from its versions distorted by errors of a certain type. These erroneous versions are considered as outputs of repeated transmissions over a channel, either a combinatorial channel defined by the maximum number of permissible errors of a given type, or a discrete memoryless channel. We are interested in the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information leakage of Feistel ciphers

    Publication Year: 2001, Page(s):23 - 35
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    We examine the information leakage between sets of plaintext and ciphertext bits in symmetric-key block ciphers. The paper demonstrates the effectiveness of information leakage as a measure of cipher security by relating information leakage to linear cryptanalysis and by determining a lower bound on the amount of data required in an attack from an upper bound on information leakage. As well, a mod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preparata codes through lattices

    Publication Year: 2001, Page(s):36 - 44
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (235 KB) | HTML iconHTML

    We define an elementary family of lattices, from which we obtain a family of extended cyclic codes with coefficients in the modular integers. The first nontrivial subfamily is the family of quaternary Preparata codes. The family of dual codes coincides with the extended low-correlation sequences introduced by Kumar, Helleseth, and Calderbank (1995). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On algebraic soft-decision decoding algorithms for BCH codes

    Publication Year: 2001, Page(s):45 - 58
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    Three algebraic soft-decision decoding algorithms are presented for binary Bose-Chaudhuri-Hocquengham (BCH) codes. Two of these algorithms are based on the bounded distance (BD)+1 generalized minimum-distance (GMD) decoding presented by Berlekamp (1984), and the other is based on Chase (1972) decoding. A simple algebraic algorithm is first introduced, and it forms a common basis for the decoding a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soft-decision decoding using punctured codes

    Publication Year: 2001, Page(s):59 - 71
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB) | HTML iconHTML

    Let a q-ary linear (n,k)-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length s /spl isin/ [k,n]. First, we take s cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length s into two parts and examine T most plausible error patterns on either pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some basic properties of fix-free codes

    Publication Year: 2001, Page(s):72 - 87
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. This class of codes is applied to speed up the decoding process, for the decoder can decode from both sides of the compressed file simultaneously. We study some basic properties of fix-free codes. We prove a sufficient and a necessary condition for the existence of fix-free codes, and we obtain ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line adaptive canonical prefix coding with bounded compression loss

    Publication Year: 2001, Page(s):88 - 98
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (251 KB) | HTML iconHTML

    Semistatic minimum-redundancy prefix (MRP) coding is fast compared with rival coding methods, but requires two passes during encoding. Its adaptive counterpart, dynamic Huffman coding, requires only one pass over the input message for encoding and decoding, and is asymptotically efficient. Dynamic Huffman (1952) coding is, however, notoriously slow in practice. By removing the restriction that the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Natural type selection in adaptive lossy compression

    Publication Year: 2001, Page(s):99 - 111
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB) | HTML iconHTML

    Consider approximate (lossy) matching of a source string /spl sim/P, with a random codebook generated from reproduction distribution Q, at a specified distortion d. Previous work determined the minimum coding rate R/sub 1/=R(P, Q, d) for this setting. We observe that for a large word length and with high probability, the matching codeword is typical with a distribution Q/sub 1/ which is different ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block-definition approaches to source coding with a fidelity criterion

    Publication Year: 2001, Page(s):112 - 125
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    We give a new variable-rate and variable-distortion coding scheme and show a coding theorem for time-discrete stationary sources with abstract alphabets and a single-letter fidelity criterion without assuming reference letters. The approach used to prove the coding theorem is then specialized to maximum-distortion coding and to fixed-rate coding and the corresponding coding theorems are proved for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics

    Publication Year: 2001, Page(s):126 - 145
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB) | HTML iconHTML

    The redundancy problem of universal lossy source coding at a fixed rate level is considered. Under some condition on the single-letter distortion measure, which implies that the cardinality K of the reproduction alphabet is not greater than the cardinality J of the source alphabet, it is shown that the redundancy of universally coding memoryless sources p by nth-order block codes of rate R goes li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On simple oversampled A/D conversion in L/sup 2/(R)

    Publication Year: 2001, Page(s):146 - 154
    Cited by:  Papers (29)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    The accuracy of oversampled analog-to-digital (A/D) conversion, the dependence of accuracy on the sampling interval /spl tau/ and on the bit rate R are characteristics fundamental to A/D conversion but not completely understood. These characteristics are studied for oversampled A/D conversion of band-limited signals in L/sup 2/ (R). We show that the digital sequence obtained in the process of over... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noise reduction in oversampled filter banks using predictive quantization

    Publication Year: 2001, Page(s):155 - 172
    Cited by:  Papers (64)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (491 KB) | HTML iconHTML

    We introduce two methods for quantization noise reduction in oversampled filter banks. These methods are based on predictive quantization (noise shaping or linear prediction). It is demonstrated that oversampled noise shaping or linear predictive subband coders are well suited for subband coding applications where, for technological or other reasons, low-resolution quantizers have to be used. In t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital representations of operators on band-limited random signals

    Publication Year: 2001, Page(s):173 - 177
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    Sampling representations of bounded linear operators (BLOs) acting on extended classes of band-limited signals are derived. These are classes of deterministic signals that are not necessarily square-integrable and random signals with covariance functions that are not necessarily square-integrable on the plane. These classes consist of signals whose Fourier transforms, defined as generalized functi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the estimation of buffer overflow probabilities from measurements

    Publication Year: 2001, Page(s):178 - 191
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (474 KB) | HTML iconHTML

    We propose estimators of the buffer overflow probability in queues fed by a Markov-modulated input process and serviced by an autocorrelated service process. These estimators are based on large-deviations asymptotics for the overflow probability. We demonstrate that the proposed estimators are less likely to underestimate the overflow probability than the estimator obtained by certainty equivalenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal entropy of states emerging from noisy quantum channels

    Publication Year: 2001, Page(s):192 - 209
    Cited by:  Papers (159)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (454 KB) | HTML iconHTML

    We consider the minimal entropy of qubit states transmitted through two uses of a noisy quantum channel, which is modeled by the action of a completely positive trace-preserving (or stochastic) map. We provide strong support for the conjecture that this minimal entropy is additive, namely, that the minimum entropy can be achieved when product states are transmitted. Explicitly, we prove that for a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error exponents of modulo-additive noise channels with side information at the transmitter

    Publication Year: 2001, Page(s):210 - 218
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    Consider the optimum strategy for using channel state ("side") information in transmission over a modulo-additive noise channel, with state-dependent noise, where the receiver does not have access to the side information (SI). Previous work showed that capacity-wise, the optimum transmitter shifts each code letter by a "prediction" of the noise sample based on the SI. We show that this structure a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise

    Publication Year: 2001, Page(s):219 - 240
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colored Gaussian noise under an input power constraint. The region is obtained by first defining a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for parallel degraded broadcast channels is known. We th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically optimal water-filling in vector multiple-access channels

    Publication Year: 2001, Page(s):241 - 267
    Cited by:  Papers (121)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Dynamic resource allocation is an important means to increase the sum capacity of fading multiple-access channels (MACs). In this paper, we consider vector multi-access channels (channels where each user has multiple degrees of freedom) and study the effect of power allocation as a function of the channel state on the sum capacity (or spectral efficiency) defined as the maximum sum of rates of use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiuser receivers for randomly spread signals: fundamental limits with and without decision-feedback

    Publication Year: 2001, Page(s):268 - 283
    Cited by:  Papers (32)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB) | HTML iconHTML

    Synchronous code-division multiple-access (CDMA) communication systems with randomly chosen spreading sequences and capacity-achieving forward error correction coding are analyzed in terms of spectral efficiency. Emphasis is on the penalties paid by applying single-user coding in conjunction with suboptimal multiuser receivers as opposed to optimal joint decoding which involves complexity that is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indecomposable error sequences in multiuser detection

    Publication Year: 2001, Page(s):284 - 294
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (265 KB) | HTML iconHTML

    In this paper, we provide a graph-based characterization of the set of indecomposable sequences that are useful in the computation of an upper bound to error probability of maximum-likelihood (ML) detection in code-division multiple-access (CDMA) multiuser systems. We apply this characterization to a K-user symmetric system and to a two-user two-rate system. It leads to a precise calculation of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noncoherent multiuser detection for nonlinear modulation over the Rayleigh-fading channel

    Publication Year: 2001, Page(s):295 - 307
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    The jointly optimum noncoherent multiuser detector is obtained for nonlinear nonorthogonal modulation over the frequency nonselective Rayleigh-fading multiple-access channel. Upper and lower bounds on the average bit-error probability are derived. While these bounds are numerically computable, they are too complicated to give insight into the relative influence of the system parameters on the esse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On achievable performance of spatial diversity fading channels

    Publication Year: 2001, Page(s):308 - 325
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (501 KB) | HTML iconHTML

    Channel time-variation and frequency selectivity [causing intersymbol interference (ISI)] are two major impairments in transmission for a wireless communication environment. Spatial diversity on the transmitter or the receiver side has been traditionally used to combat multipath fading. Previous results indicate significant gains in using multiple transmitter and receiver antenna diversity. By der... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The estimated cost of a search tree on binary words

    Publication Year: 2001, Page(s):326 - 329
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (111 KB) | HTML iconHTML

    The problem of constructing a binary search tree for a set of binary words has wide applications in computer science, biology, mineralogy, etc. Shannon considered a similar statement in his optimal coding theorem. It is NP-complete to construct a tree of minimum cost; therefore, the problem arises of finding simple algorithms for constructing nearly optimal trees. We show that there is a simple al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Csiszar's cutoff rates for arbitrary discrete sources

    Publication Year: 2001, Page(s):330 - 338
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    Csiszar's (1995) forward /spl beta/-cutoff rate (given a fixed /spl beta/>0) for a discrete source is defined as the smallest number R/sub 0/ such that for every R>R/sub 0/, there exists a sequence of fixed-length codes of rate R with probability of error asymptotically vanishing as e/sup -n/spl beta/(R-R0)/. For a discrete memoryless source (DMS), the forward /spl beta/-cutoff rate is shown... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The first-order asymptotic of waiting times with distortion between stationary processes

    Publication Year: 2001, Page(s):338 - 347
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (502 KB)

    Let X and Y be two independent stationary processes on general metric spaces, with distributions P and Q, respectively. The first-order asymptotic of the waiting time W/sub n/(D) between X and Y, allowing distortion, is established in the presence of one-sided /spl psi/-mixing conditions for Y. With probability one, n/sup -1/log W/sub n/(D) has the same limit as -n/sup -1/logQ(B(X/sub 1//sup n/, D... 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
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu