IEEE Transactions on Information Theory

Volume 44 Issue 1 • Jan. 1998

Filter Results

Displaying Results 1 - 25 of 47
  • Wavelet analysis of long-range-dependent traffic

    Publication Year: 1998, Page(s):2 - 15
    Cited by:  Papers (497)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    A wavelet-based tool for the analysis of long-range dependence and a related semi-parametric estimator of the Hurst parameter is introduced. The estimator is shown to be unbiased under very general conditions, and efficient under Gaussian assumptions. It can be implemented very efficiently allowing the direct analysis of very large data sets, and is highly robust against the presence of determinis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms

    Publication Year: 1998, Page(s):16 - 31
    Cited by:  Papers (242)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (646 KB)

    Coefficient quantization has peculiar qualitative effects on representations of vectors in IR with respect to overcomplete sets of vectors. These effects are investigated in two settings: frame expansions (representations obtained by forming inner products with each element of the set) and matching pursuit expansions (approximations obtained by greedily forming linear combinations). In both cases,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation of 1/f noise

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

    Several models have emerged for describing 1/f/sup /spl gamma// noise processes. Based on these, various techniques for estimating the properties of such processes have been developed. This paper provides theoretical analysis of a new wavelet-based approach which has the advantages of having low computational complexity and being able to handle the case where the 1/f/sup /spl gamma// noise might b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance of data compression algorithms based upon string matching

    Publication Year: 1998, Page(s):47 - 65
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1218 KB)

    Lossless and lossy data compression algorithms based on string matching are considered. In the lossless case, a result of Wyner and Ziv (1989) is extended. In the lossy case, a data compression algorithm based on approximate string matching is analyzed in the following two frameworks: (1) the database and the source together form a Markov chain of finite order; (2) the database and the source are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sliding-window universal data compression with limited memory

    Publication Year: 1998, Page(s):66 - 78
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB)

    Nonasymptotic coding and converse theorems are derived for universal data compression algorithms in cases where the training sequence ("history") that is available to the encoder consists of the most recent segment of the input data string that has been processed, but is not large enough so as to yield the ultimate compression, namely, the entropy of the source. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary lattice vector quantization with linear block codes and affine index assignments

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

    We determine analytic expressions for the performance of some low-complexity combined source-channel coding systems. The main tool used is the Hadamard transform. In particular, we obtain formulas for the average distortion of binary lattice vector quantization with affine index assignments, linear block channel coding, and a binary-symmetric channel. The distortion formulas are specialized to non... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An asymptotic property of model selection criteria

    Publication Year: 1998, Page(s):95 - 116
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1254 KB)

    Probability models are estimated by use of penalized log-likelihood criteria related to Akaike (1973) information criterion (AIC) and minimum description length (MDL). The accuracies of the density estimators are shown to be related to the tradeoff between three terms: the accuracy of approximation, the model dimension, and the descriptive complexity of the model classes. The asymptotic risk is de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory-universal prediction of stationary random processes

    Publication Year: 1998, Page(s):117 - 133
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (958 KB)

    We consider the problem of one-step-ahead prediction of a real-valued, stationary, strongly mixing random process (Xi)/sub i=-/spl infin///sup /spl infin//. The best mean-square predictor of X/sub 0/ is its conditional mean given the entire infinite past (X/sub i/)/sub i=-/spl infin///sup -1/. Given a sequence of observations X/sub 1/, X/sub 2/, X/sub N/, we propose estimators for the conditional ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shadow bounds for self-dual codes

    Publication Year: 1998, Page(s):134 - 139
    Cited by:  Papers (111)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB)

    Conway and Sloane (1990) have previously given an upper bound on the minimum distance of a singly-even self-dual binary code, using the concept of the shadow of a self-dual code. We improve their bound, finding that the minimum distance of a self-dual binary code of length n is at most 4[n/24]+4, except when n mod 24=22, when the bound is 4[n/24]+6. We also show that a code of length a multiple of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on mixed binary/ternary codes

    Publication Year: 1998, Page(s):140 - 161
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1531 KB)

    Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis

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

    Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain /spl gamma/ of L, and are obtained based on a decoding algorithm which is an improved version of Kannan's (1983) method. The latter is currently the fastest known method for the decoding of a general lattice. For the decoding of a point x, the propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary sequence sets with favorable correlations from difference sets and MDS codes

    Publication Year: 1998, Page(s):172 - 180
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB)

    We propose new families of pseudorandom binary sequences based on Hadamard difference sets and MDS codes. We obtain, for p=4k-1 prime and t an integer with 1/spl les/t/spl les/(p-1)/2, a set of p/sup t/ binary sequences of period p/sup 2/ whose peak correlation is bounded by 1+2t(p+1). The sequences are balanced, have high linear complexity, and are easily generated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Hamming weights of q-ary Reed-Muller codes

    Publication Year: 1998, Page(s):181 - 196
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (982 KB)

    The order bound on generalized Hamming weights is introduced in a general setting of codes on varieties which comprises both the one point geometric Goppa codes as well as the q-ary Reed-Muller codes. For the latter codes it is shown that this bound is sharp and that they satisfy the double chain condition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of binary channels that use linear codes and decoders

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

    This paper analyzes the performance of concatenated coding systems operating over the binary-symmetric channel (BSC) by examining the loss of capacity resulting from each of the processing steps. The techniques described in this paper allow the separate evaluation of codes and decoders and thus the identification of where loss of capacity occurs. They are, moreover, very useful for the overall des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The common randomness capacity of a pair of independent discrete memoryless channels

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

    We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e. agree on a common random variable, by communicating interactively over the two channels. Assuming that Alice and Bob are allowed access to independent external random sources at rates (in bits per step of communication) of H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Common randomness in information theory and cryptography. II. CR capacity

    Publication Year: 1998, Page(s):225 - 240
    Cited by:  Papers (110)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (917 KB)

    For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by commo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of multilevel threshold devices

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

    The principal purpose of this research is to discover the underlying properties of linear multilevel threshold devices and networks of linear multilevel threshold devices. The main theoretical developments of this investigation entail generalizing the function-counting theorem associated with linear bi-level threshold devices to that of linear multilevel threshold devices. The investigation reveal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of two-layer feedforward neural networks with binary weights

    Publication Year: 1998, Page(s):256 - 268
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (717 KB)

    The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero threshold for the output unit is obtained through two steps. First, through a constructive approach based on statistical analysis, it is shown that a specifically constructed (N-2L-1) network with N input units, 2L hidden u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of the quantum channel with general signal states

    Publication Year: 1998, Page(s):269 - 273
    Cited by:  Papers (549)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB)

    It is shown that the capacity of a classical-quantum channel with arbitrary (possibly mixed) states equals the maximum of the entropy bound with respect to all a priori distributions. This completes the recent result of Hausladen, Jozsa, Schumacher, Westmoreland, and Wootters (1996), who proved the equality for the pure state channel. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice codes can achieve capacity on the AWGN channel

    Publication Year: 1998, Page(s):273 - 278
    Cited by:  Papers (67)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    It is shown that lattice codes can achieve capacity on the additive white Gaussian noise channel. More precisely, for any rate R less than capacity and e>0, there exists a lattice code with rate no less than R and average error probability upper-bounded by e. These lattice codes include all points of the (translated) lattice within the spherical bounding region (not just the ones inside a thin ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic analysis of multiple description quantizers

    Publication Year: 1998, Page(s):278 - 284
    Cited by:  Papers (65)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB)

    A high-rate analysis of multiple description quantizers is presented for rth-power distortions and general source densities. Both, fixed-length and variable-length encoding of the quantizer indices are considered. Optimal companding functions are shown to be the same as for single-channel quantizers. As compared to the bound of Ozarow (1980), a gap of 8.69 dB and 3.07 dB exists between the entropy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification plus transmission over channels with perfect feedback

    Publication Year: 1998, Page(s):284 - 290
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (365 KB)

    We determine the region of all identification and transmission rate-pairs achievable over a discrete memoryless channel (DMC) with perfect and instantaneous feedback, for both randomized and deterministic encoding. As a by-product, we also have a new proof of Kemperman's (1973) strong converse to Shannon's coding theorem for DMC's with feedback. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Goppa codes and trace operator

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

    We study Goppa codes, /spl Gamma/(L,g), defined by the polynomial g(z)=a(z)TrF/sub p/ms:F/sub p/s(b(z)). It is shown that the dimension of these codes never reaches the general, well-known, bound for Goppa codes. New bounds are proposed depending on the value of m and p. Furthermore, we prove that when p=2 these codes have only even weights. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectra of long primitive binary BCH codes cannot approach the binomial distribution

    Publication Year: 1998, Page(s):294 - 295
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    Usually spectra (weight distributions) of primitive binary BCH codes are supposed to approximate binomial weight distributions well for a wide range of code rates and code lengths. It is shown that for any fixed code rate R<1 spectra of long (N/spl rarr//spl infin/) primitive binary BCH codes cannot approximate the binomial distribution at all. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Laplace's law of succession and universal encoding

    Publication Year: 1998, Page(s):296 - 303
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (326 KB)

    This correspondence shows that the known "add-half" rule is not asymptotically optimal for predicting the (n+1)st symbol after a sequence of n symbols, whereas the "add-/spl beta//sub 0/" rule, /spl beta//sub 0/=0.50922/spl middot//spl middot//spl middot/is. 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