IEEE Transactions on Information Theory

Volume 39 Issue 1 • Jan. 1993

Filter Results

Displaying Results 1 - 25 of 49
  • Two theorems on lattice expansions

    Publication Year: 1993, Page(s):3 - 6
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (269 KB)

    It is shown that there is a tradeoff between the smoothness and decay properties of the dual functions, occurring in the lattice expansion problem. More precisely, it is shown that if g and g are dual, then (1) at least one of H/sup 1/2/ g and H/sup 1/2/ g is n in L/sup 2/(R), and (2) at least one of Hg and g is not in L/sup 2/(R). Here, H is the operator -1/(4 pi /sup 2/)d/sup 2//(dt/sup 2/)+t/su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wavelet decomposition of harmonizable random processes

    Publication Year: 1993, Page(s):7 - 18
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (801 KB)

    The discrete wavelet decomposition of second-order harmonizable random processes is considered. The deterministic wavelet decomposition of a complex exponential function is examined, where its pointwise and bounded convergence to the function is proved. This result is then used for establishing the stochastic wavelet decomposition of harmonizable processes. The similarities and differences between... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the capacity of a spectrally constrained Poisson channel

    Publication Year: 1993, Page(s):19 - 29
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (818 KB)

    An upper bound is derived on the capacity of a Poisson channel that has a stationary input process of a given spectrum and is subjected to peak and average power constraints. The bound is shown to be asymptotically tight with the relaxation of the spectral constraints. Its maximization over a given set of admissible spectra is closely related to an analogous problem in the AWGN regime. The results... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit construction of optimal constant-weight codes for identification via channels

    Publication Year: 1993, Page(s):30 - 36
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (531 KB)

    The identification coding theorems of R. Ahlswede and G. Dueck (1981) have shown that for any nonzero probabilities of missed and false identification, it is possible to transmit exp(exp(nR)) messages with n uses of a noisy channel, where R is as close as desired to the Shannon capacity of the channel. That capability is achieved by the identification codes explicitly constructed with a three-laye... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding algebraic-geometric codes up to the designed minimum distance

    Publication Year: 1993, Page(s):37 - 45
    Cited by:  Papers (119)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (645 KB)

    A simple decoding procedure for algebraic-geometric codes C/sub Omega /(D,G) is presented. This decoding procedure is a generalization of Peterson's decoding procedure for the BCH codes. It can be used to correct any ((d*-1)/2) or fewer errors with complexity O(n/sup 3/), where d* is the designed minimum distance of the algebraic-geometric code and n is the codelength.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattice and trellis quantization with lattice- and trellis-bounded codebooks-High-rate theory for memoryless sources

    Publication Year: 1993, Page(s):46 - 59
    Cited by:  Papers (79)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1329 KB)

    High-rate lattice and trellis quantizers for nonuniform sources are introduced and analyzed. The performance of these quantizers is determined by two separable quantities, the granular gain and the boundary gain, which are determined by the shapes of the granular cells and of the support region, respectively. The granular gain and boundary gain are the duals of shaping and coding gain in data tran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding spherical codes for the Gaussian channel

    Publication Year: 1993, Page(s):60 - 65
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A decoding algorithm for permutation codes that is equivalent to maximum-likelihood decoding, but less complex than the correlation decoder, is presented. A general construction for iteratively maximum-likelihood decodable (IMLD) codes is proved and used to construct IMLD codes for every dimension n. D. Slepian (1965) defined permutation modulation codes and presented an efficient algorithm for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New array codes for multiple phased burst correction

    Publication Year: 1993, Page(s):66 - 77
    Cited by:  Papers (84)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (930 KB)

    An optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is introduced. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts of vectors o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy and data compression schemes

    Publication Year: 1993, Page(s):78 - 83
    Cited by:  Papers (130)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (471 KB)

    Some new ways of defining the entropy of a process by observing a single typical output sequence as well as a new kind of Shannon-McMillan-Breiman theorem are presented. This provides a new and conceptually very simple ways of estimating the entropy of an ergodic stationary source as well as new insight into the workings of such well-known data compression schemes as the Lempel-Ziv algorithm.<&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the average delay for routing subject to independent deflections

    Publication Year: 1993, Page(s):84 - 91
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (609 KB)

    Consider a packet walking along a directed graph with each node having two edges directed out. The packet is headed towards one of N destinations, chosen according to a probability distribution p. At each step, the packet is forced to use a nonpreferred edge with some probability q, independently of past events. Using information theory and sequential analysis, it is shown that the mean number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recurrence times of buffer overflows in Jackson networks

    Publication Year: 1993, Page(s):92 - 97
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (398 KB)

    The estimation of the statistics of buffer overflows in networks of queues by means of simulation is inherently costly, simply because of the rarity of these events. An alternative analytic approach is presented, with very low computational cost, for calculating the recurrence time of buffer overflows for Jackson networks in which the recurrence times of buffer overflows in a network are expressed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of packet loss processes in high-speed networks

    Publication Year: 1993, Page(s):98 - 108
    Cited by:  Papers (116)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    The packet loss process in a single-server queueing system with a finite buffer capacity is analyzed. The model used addresses the packet loss probabilities for packets within a block of a consecutive sequence of packets. An analytical approach is presented that yields efficient recursions for the computation of the distribution of the number of lost packets within a block of packets of fixed or v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large deviations for coding Markov chains and Gibbs random fields

    Publication Year: 1993, Page(s):109 - 118
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (794 KB)

    Fixed block coding schemes for Gibbs random fields are proposed in which the empirical expectations of the local interactions of the Gibbs measure is compared to its expectation with respect to all Gibbs measures having those interactions. The exponential decay of the error probabilities is proven and it is shown that the code rates equal the entropy of the random field. In addition, it is shown t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the optimality and stability of exponential twisting in Monte Carlo estimation

    Publication Year: 1993, Page(s):119 - 128
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Estimation of the large deviations probability p/sub n/=P(S/sub n/>or= gamma n) via importance sampling is considered, where S/sub n/ is a sum of n i.i.d. random variables. It has been previously shown that within the nonparametric candidate family of all i.i.d. (or, more generally, Markov) distributions, the optimized exponentially twisted distribution is the unique asymptotically optimal samp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local convergence of the Sato blind equalizer and generalizations under practical constraints

    Publication Year: 1993, Page(s):129 - 144
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1259 KB)

    An early use of recursive identification in blind adaptive channel equalization is an algorithm developed by Y. Sato (1975). An important generalization of the Sato algorithm with extensive analysis appears in the work of A. Benveniste et al. (1980). These generalized algorithms have been shown to possess a desirable global convergence property under two idealized conditions. The convergence prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds to the error probability of decision feedback equalization

    Publication Year: 1993, Page(s):145 - 156
    Cited by:  Papers (37)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (797 KB)

    The exact computation of the symbol error probability of systems using decision feedback equalization is difficult due to the propagation of errors. New upper bounds to the error probability of decision feedback equalization, which take error propagation into account, are developed. The derivations of the bounds assume a causal channel response, independent data symbols, and independent noise samp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noncoherent detection in asynchronous multiuser channels

    Publication Year: 1993, Page(s):157 - 176
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1621 KB)

    The noncoherent demodulation of multiple differentially phase-shift-keyed signals transmitted simultaneously over an asynchronous code-division multiple-access (CDMA) channel with white Gaussian background noise is considered. A class of bilinear detectors is defined with the objective of obtaining the optimal bilinear detector. The optimality criterion considered is near-far resistance that denot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cascaded GMW sequences

    Publication Year: 1993, Page(s):177 - 183
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB)

    Pseudorandom binary sequences with high linear complexity and low correlation function values are sought in many applications of modern communication systems. A new family of pseudorandom binary sequences, cascaded GMW sequences, is constructed. These sequences are shown to share many desirable correlation properties with the GMW sequences of B. Gordon, W.A. Mills, and L.R. Welch (1962)-for exampl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The channel capacity of discrete time phase modulation in AWGN

    Publication Year: 1993, Page(s):184 - 185
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (155 KB)

    The capacity of a bandlimited phase-only modulated system in additive white Gaussian noise is calculated, where the phase is not restricted to a finite alphabet and the demodulator supplies only phase measurements. The results match a known asymptote at high signal-to-noise ratios and form an upper limit on the capacities of MPSK for finite M.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels

    Publication Year: 1993, Page(s):186 - 191
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (563 KB)

    A shared directional multichannel (SDM) consists of a set of inputs and a set of outputs to which transmitters and receivers respectively, are connected. A signal placed at any given input reaches a subset of the outputs, and a channel is specified by the sets of outputs that are reachable from each input. A message is received successfully at an output of the channel if and only if it is addresse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Growing binary trees in a random environment

    Publication Year: 1993, Page(s):191 - 194
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB)

    A class of binary trees that grow in a random environment, where the state of the environment can change at every vertex of the trees, is studied. The trees considered are single-type and two-type binary trees that grow in a two-state Markovian environment. For each kind of tree, the conditions on the environment process for extinction of the tree are determined, and the problem of calculating the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code constructions for asynchronous random multiple-access to the adder channel

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

    A situation where up to T randomly chosen users, out of M potential ones, simultaneously transmit data over the noiseless adder channel (AC) is considered. These T (or fewer) active users operate independently, and because of unknown time offsets among their clocks and different delays that the various messages incur during transmission, both block and bit synchronism are precluded. Code construct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On maximum likelihood soft-decision decoding of binary linear codes

    Publication Year: 1993, Page(s):197 - 203
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB)

    Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear codes are derived. Instead of checking only error patterns yielding a codeword when added to the rounded-off version of the received vector, these implementations principally consider all possible column patterns. Compared to known implementations, this allows a more efficient use of branching and bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the trellis size of linear block codes

    Publication Year: 1993, Page(s):203 - 209
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The size of minimal trellis representation of linear block codes is addressed. Two general upper bounds on the trellis size, based on the zero-concurring codewords and the contraction index of the subcodes, are presented. The related permutations for attaining the bounds are exhibited. These bounds evidently improve the previously published general bound. Additional bounds based on certain code co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions for perfect mixed codes and other covering codes

    Publication Year: 1993, Page(s):209 - 214
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (531 KB)

    A construction for an infinite family of perfect mixed codes with covering radius 2 is presented. These are the first known nontrivial perfect mixed codes with covering radius greater than 1. Based on mixed codes, constructions for binary covering codes that lead to a considerable improvement of upper bounds on the sizes of covering codes are presented. These codes and some other codes can be obta... 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