IEEE Transactions on Information Theory

Volume 44 Issue 3 • May 1998

Filter Results

Displaying Results 1 - 25 of 48
  • Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

    Publication Year: 1998, Page(s):909 - 926
    Cited by:  Papers (744)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (637 KB)

    A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords. The construction can be generalized to h cascaded encoders separated by h-1 interleavers. We obtain upper bounds to the average maximum-likelihood bit error probability of serially conc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-interleaved coded modulation

    Publication Year: 1998, Page(s):927 - 946
    Cited by:  Papers (1659)  |  Patents (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (850 KB)

    It has been recognized by Zehavi (1992) that the performance of coded modulation over a Rayleigh fading channel can be improved by bit-wise interleaving at the encoder output, and by using an appropriate soft-decision metric as an input to a Viterbi (1990) decoder. The paper presents in a comprehensive fashion the theory underlying bit-interleaved coded modulation, provides tools for evaluating it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximin performance of binary-input channels with uncertain noise distributions

    Publication Year: 1998, Page(s):947 - 972
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1347 KB)

    We consider uncertainty classes of noise distributions defined by a bound on the divergence with respect to a nominal noise distribution. The noise that maximizes the minimum error probability for binary-input channels is found. The effect of the reduction in uncertainty brought about by knowledge of the signal-to-noise ratio is also studied. The particular class of Gaussian nominal distributions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The compound channel capacity of a class of finite-state channels

    Publication Year: 1998, Page(s):973 - 983
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    A transmitter and receiver need to be designed to guarantee reliable communication on any channel belonging to a given family of finite-state channels defined over common finite input, output, and state alphabets. Both the transmitter and receiver are assumed to be ignorant of the channel over which transmission is carried out and also ignorant of its initial state. For this scenario we derive an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New converses in the theory of identification via channels

    Publication Year: 1998, Page(s):984 - 998
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (834 KB)

    New converses for identification via arbitrary single-user and multiple-access channels, with finite first- and second-type probabilities of error, are developed. For the arbitrary single-user channel, it is shown that (/spl lambda//sub 1/, /spl lambda//sub 2/)-identification capacity is upper-bounded by /spl lambda/-capacity, and optimistic (/spl lambda//sub 1/,/spl lambda//sub 2/)-identification... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • About the asymptotic accuracy of Barron density estimates

    Publication Year: 1998, Page(s):999 - 1009
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB)

    By extending the information-theoretic arguments of previous papers dealing with the Barron-type density estimates, and their consistency in information divergence and chi-square divergence, the problem of consistency in Csiszar's /spl phi/-divergence is motivated for general convex functions /spl phi/. The problem of consistency in /spl phi/-divergence is solved for all /spl phi/ with /spl phi/(0... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error bounds for functional approximation and estimation using mixtures of experts

    Publication Year: 1998, Page(s):1010 - 1025
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (829 KB)

    We examine some mathematical aspects of learning unknown mappings with the mixture of experts model (MEM). Specifically, we observe that the MEM is at least as powerful as a class of neural networks, in a sense that will be made precise. Upper bounds on the approximation error are established for a wide class of target functions. The general theorem states that /spl par/f-f/sub n//spl par//sub p//... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The efficiency of investment information

    Publication Year: 1998, Page(s):1026 - 1040
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (730 KB)

    We investigate how the description of a correlated information V improves the investment in the stock market X. The objective is to maximize the growth rate of wealth in repeated investments, We find a single-letter characterization of the incremental growth rate /spl Delta/(R), the maximum increase in growth rate when V is described to the investor at rate R. The incremental growth rate specializ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guessing subject to distortion

    Publication Year: 1998, Page(s):1041 - 1056
    Cited by:  Papers (66)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (922 KB)

    We investigate the problem of guessing a random vector X within distortion level D. Our aim is to characterize the best attainable performance in the sense of minimizing, in some probabilistic sense, the number of required guesses G(X) until the error falls below D. The underlying motivation is that G(X) is the number of candidate codewords to be examined by a rate-distortion block encoder until a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The rate-distortion function for the quadratic Gaussian CEO problem

    Publication Year: 1998, Page(s):1057 - 1070
    Cited by:  Papers (195)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (829 KB)

    A new multiterminal source coding problem called the CEO problem was presented and investigated by Berger, Zhang, and Viswanathan. Recently, Viswanathan and Berger have investigated an extension of the CEO problem to Gaussian sources and call it the quadratic Gaussian CEO problem. They considered this problem from a statistical viewpoint, deriving some interesting results. In this paper, we consid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operational capacity and pseudoclassicality of a quantum channel

    Publication Year: 1998, Page(s):1071 - 1086
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (929 KB)

    We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including: 1) adaptive measurement with feedback code; 2) reconsideration of single-letterized capacity formula; and 3) pseudoclassicality of a channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of network calculus to guaranteed service networks

    Publication Year: 1998, Page(s):1087 - 1096
    Cited by:  Papers (173)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    We use previous network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of results that apply min-plus algebra to packet networks. We provide a simple proof that shaping a traffic stream to conform to a burstiness constraint preserves the original constraints satisfied by the traffic stream. We show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On deterministic traffic regulation and service guarantees: a systematic approach by filtering

    Publication Year: 1998, Page(s):1097 - 1110
    Cited by:  Papers (89)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (625 KB)

    We develop a filtering theory for deterministic traffic regulation and service guarantees under the (min, +)-algebra. We show that traffic regulators that generate f-upper constrained outputs can be implemented optimally by a linear time-invariant filter with the impulse response f/sub */ under the (min, +)-algebra, where f/sub */ is the subadditive closure defined in the paper. Analogous to the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some distributional properties of the continuous wavelet transform of random processes

    Publication Year: 1998, Page(s):1111 - 1124
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    Without finite moment conditions, some properties of random processes, such as stationarity and self-similarity, are characterized via corresponding properties of their wavelet transform. Anyone of these distributional properties of the wavelet transform characterizes the corresponding property of the increments of the random process, of order equal to the order of regularity of the analyzing wave... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Input recovery from noisy output data, using regularized inversion of the Laplace transform

    Publication Year: 1998, Page(s):1125 - 1130
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB)

    In a dynamical system the input is to be recovered from finitely many measurements, blurred by random error, of the output of the system. As usual, the differential equation describing the system is reduced to multiplication with a polynomial after applying the Laplace transform. It appears that there exists a natural, unbiased, estimator for the Laplace transform of the output, from which an esti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irregular sampling theorems for wavelet subspaces

    Publication Year: 1998, Page(s):1131 - 1142
    Cited by:  Papers (44)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (775 KB)

    From the Paley-Wiener 1/4-theorem, the finite energy signal f(t) can be reconstructed from its irregularly sampled values f(k+/spl delta//sub /spl kappa//) if f(t) is band-limited and sup/sub /spl kappa//|/spl delta//sub /spl kappa//|<1/4. We consider the signals in wavelet subspaces and wish to recover the signals from its irregular samples by using scaling functions. Then the method of estima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical secrecy and multibit commitments

    Publication Year: 1998, Page(s):1143 - 1151
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (372 KB)

    We present and compare definitions of "statistically hiding" protocols, and we propose a novel statistically hiding commitment scheme. Informally, a protocol statistically hides a secret if a computationally unlimited adversary who conducts the protocol with the owner of the secret learns almost nothing about it. One definition is based on the L/sub 1/-norm distance between probability distributio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New double-byte error-correcting codes for memory systems

    Publication Year: 1998, Page(s):1152 - 1163
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (805 KB)

    Double-byte error-correcting codes over GF(q) were constructed by Dumer (1981, 1988, 1992, 1995), which have the parameters n=q/sup m-1/, r/spl les/2m+[m-1/3], m=2, 3, ..., when q is even, and have the parameters n=q/sup m/, r/spl les/2m+[m/3]+1, m=2; 3, ..., when q is odd, respectively. We construct a class of double-byte error-correcting codes over GF(2/sup i/), which have the following paramete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on partial correlations of sequences

    Publication Year: 1998, Page(s):1164 - 1175
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Two approaches to bounding the partial auto- and crosscorrelations of binary sequences are considered. The first approach uses the discrete Fourier transform and bounds for character sums to obtain bounds on partial autocorrelations of m-sequences and on the partial auto- and crosscorrelations for the small Kasami sets and dual-BCH families of sequences. The second approach applies to binary seque... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAP decoding of convolutional codes using reciprocal dual codes

    Publication Year: 1998, Page(s):1176 - 1187
    Cited by:  Papers (46)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (515 KB)

    A new symbol-by-symbol maximum a posteriori (MAP) decoding algorithm for high-rate convolutional codes using reciprocal dual convolutional codes is presented. The advantage of this approach is a reduction of the computational complexity since the number of codewords to consider is decreased for codes of rate greater than 1/2. The discussed algorithms fulfil all requirements for iterative ("turbo")... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How often is hard-decision decoding enough?

    Publication Year: 1998, Page(s):1187 - 1193
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB)

    The problem of decoding binary linear block codes has received much attention; the two extremes are optimal, high-complexity soft-decision (or maximum-likelihood) decoding and lower performance, much lower complexity hard-decision (or algebraic) decoding. This article considers a class of decoders which first implements hard-decision decoding; second, tests to see if that is enough, that its resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity and coding gain of certain checkerboard codes

    Publication Year: 1998, Page(s):1193 - 1203
    Cited by:  Papers (73)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    We define a checkerboard code as a two-dimensional binary code that satisfies some constraint, e.g., every binary one must be surrounded by eight zeros, and then investigate the capacity for each of several different constraints. Using a recursive construction we develop a series of loose bounds on the capacity. These bounds, in turn, lead to conjecturally precise estimates of the capacity by the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacities of frequency-hopped code-division multiple-access channels

    Publication Year: 1998, Page(s):1204 - 1211
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    This correspondence investigates and compares the capacities of two types of frequency-hopped code-division multiple-access (FH-CDMA) communications systems; namely, multilevel on-off keying (OOK) and MFSK, in particular BFSK. In our multiuser channel model, we assume a random hopping pattern is used for each transmitter-receiver pair, and that the ith receiver is only interested in the message tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Te "art of trellis decoding" is computationally hard-for large fields

    Publication Year: 1998, Page(s):1211 - 1214
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (131 KB)

    The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Three measures of trellis complexity are considered: the total number of states, the total number of edges, and the maximum state complexity of the trellis. The problem is proven NP-hard for all three measures, provided the field over which the code is specified is not fixed. We leave open the problem ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reliability output Viterbi algorithm with applications to hybrid ARQ

    Publication Year: 1998, Page(s):1214 - 1216
    Cited by:  Papers (14)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (107 KB)

    We present an algorithm that permits a receiver to calculate the probability of packet error in parallel with the Viterbi decoding process. This packet reliability value may be used to request retransmissions in a type-I hybrid ARQ scheme. It is shown that this scheme can be used to guarantee any required bound on the packet error probability. In addition, this scheme can be used in conjunction wi... 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