IEEE Transactions on Information Theory

Volume 44 Issue 2 • March 1998

Filter Results

Displaying Results 1 - 25 of 47
  • The information-theoretic capacity of discrete-time queues

    Publication Year: 1998, Page(s):446 - 461
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (774 KB)

    The information-theoretic capacity of continuous-time queues was analyzed recently by Anantharam and Verdu (see ibid. vol.42, p.4-18, 1996). Along similar lines, we analyze the information-theoretic capacity of two models of discrete-time queues. The first model has single packet arrivals and departures in a time slot and independent packet service times, and is the discrete-time analog of the con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source codes as random number generators

    Publication Year: 1998, Page(s):462 - 471
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB)

    A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asymptotically fair coin flips from a stationary ergodic source at a rate of bits per source symbol equal to the entropy rate of the source. Since optimal noiseless data compression codes produce incompressible outputs, it is n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolvability theory for the multiple-access channel

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

    We study the randomness needed for approximating the output distribution of a multiple-access channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are independent of each other, and the simulators do not cooper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Poisson multiple-access channel

    Publication Year: 1998, Page(s):488 - 501
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB)

    The Poisson multiple-access channel (MAC) models many-to-one optical communication through an optical fiber or in free space. For this model we compute the capacity region for the two-user case as a function of the allowed peak power. Focusing on the maximum throughput we generalize our results to the case where the users are subjected to an additional average-power constraint and to the many-user... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic multiuser efficiencies for decision-directed multiuser detectors

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

    The asymptotic multiuser efficiencies (AMEs) are derived for various classes of decision-directed multiuser detectors, including multistage detectors, and decision-feedback detectors. Novel classes of soft-decision multistage detectors are proposed and analyzed. Each class is specified in part by a soft-decision nonlinearity, such as a symmetric quantizer or a linear clipper. Closed-form expressio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed random signal detection with multibit sensor decisions

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

    Distributed detection of weak random signals in additive, possibly non-Gaussian, noise is considered for cases with multibit sensor decisions. Signal-to-noise ratios are assumed unknown and the signals at the different sensors may be statistically dependent. Analytical expressions are provided that describe the best way to fuse the quantized observations for cases with any given number of sensors.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

    Publication Year: 1998, Page(s):525 - 536
    Cited by:  Papers (421)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (578 KB)

    Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classificatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Density estimation from an individual numerical sequence

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

    This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that (1) the limiting relative frequencies of the numerical sequence are governed by an unknown density, and (2) there is a known upper bound for the variation of the density on an increasing sequence of intervals. A simple estimation scheme is proposed, and is shown to be L/sub 1/ consiste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information and control: matching channels

    Publication Year: 1998, Page(s):542 - 563
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1260 KB)

    The transmission problem for noisy channels is usually studied under the condition that the decoding error probability /spl lambda/ is small and is sometimes studied under the condition that /spl lambda/=0. Here we just require that /spl lambda/<1 and obtain a problem which is equivalent to a coding problem with small /spl lambda/ for the "deterministic matching channel." In this new model, a c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic lossy source/channel coding

    Publication Year: 1998, Page(s):564 - 579
    Cited by:  Papers (163)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The fundamental limits of "systematic" communication are analyzed. In systematic transmission, the decoder has access to a noisy version of the uncoded raw data (analog or digital). The coded version of the data is used to reduce the average reproduced distortion D below that provided by the uncoded systematic link and/or increase the rate of information transmission. Unlike the case of arbitraril... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy/length profiles, bounds on the minimal covering of bipartite graphs, and trellis complexity of nonlinear codes

    Publication Year: 1998, Page(s):580 - 598
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB)

    The trellis representation of nonlinear codes is studied from a new perspective. We introduce the new concept of entropy/length profile (ELP). This profile can be considered as an extension of the dimension/length profile (DLP) to nonlinear codes. This elaboration of the DLP, the entropy/length profiles, appears to be suitable to the analysis of nonlinear codes. Additionally and independently, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a new class of codes for identifying vertices in graphs

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

    We investigate a new class of codes for the optimal covering of vertices in an undirected graph G such that any vertex in G can be uniquely identified by examining the vertices that cover it. We define a ball of radius t centered on a vertex /spl upsi/ to be the set of vertices in G that are at distance at most t from /spl upsi/. The vertex /spl upsi/ is then said to cover itself and every other v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The category of linear codes

    Publication Year: 1998, Page(s):612 - 629
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB)

    Slepian (1960) introduced a structure theory for linear, binary codes and proved that every such code was uniquely the sum of indecomposable codes. He had hoped to produce a canonical form for the generator matrix of an indecomposable code so that he might read off the properties of the code from such a matrix, but such a program proved impossible. We here work over an arbitrary field and define a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the automorphism group of various Goppa codes

    Publication Year: 1998, Page(s):630 - 643
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    We determine the automorphism group of various Goppa codes /spl Cscr//sub L/(D,G) associated with certain function fields F/F/sub q/ of genus g>0. It is well known that, for deg D=n>2g+2, the automorphism group {Aut/sub D,G/(F/F/sub q/) can be embedded into Aut(/spl Cscr//sub L/(D,G)) as a subgroup. We show that, under certain conditions on the divisors D and G Aut/sub D,G/(F/F/sub q/) is ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric estimation of transfer functions: rates of convergence and adaptation

    Publication Year: 1998, Page(s):644 - 658
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    The paper deals with estimating the transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for measuring the estimation accuracy. The quality of an estimator is measured by its worst case error over a family of transfer functions. The families with polynomially and exponentially decaying impulse response sequences are cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear receiver for direct-sequence spread-spectrum multiple-access systems with antenna arrays and blind adaptation

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

    A linear receiver for direct-sequence spread-spectrum multiple-access communication systems under the aperiodic random sequence model is considered. The receiver consists of the conventional matched filter followed by a tapped delay line with the provision of incorporating the use of antenna arrays. It has the ability of suppressing multiple-access interference (MAI) and narrowband interference in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Blind multiuser detection: a subspace approach

    Publication Year: 1998, Page(s):677 - 690
    Cited by:  Papers (559)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (737 KB)

    A new multiuser detection scheme based on signal subspace estimation is proposed. It is shown that under this scheme, both the decorrelating detector and the linear minimum-mean-square-error (MMSE) detector can be obtained blindly, i.e., they can be estimated from the received signal with the prior knowledge of only the signature waveform and timing of the user of interest. The consistency and asy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified method for evaluating the error-correction radius of reliability-based soft-decision algorithms for linear block codes

    Publication Year: 1998, Page(s):691 - 700
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (458 KB)

    This paper presents a unified method for evaluating the error-correction radii of many reliability-based soft-decision decoding algorithms for binary linear block codes. Based on this unified method, these decoding algorithms as well as their potential improvements can be compared directly. The error-correction radius for each of these decoding algorithms is determined by finding the closest point... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth-efficient coded modulation with optimized linear partial-response signals

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

    We study the design of optimal signals for bandwidth-efficient linear coded modulation. Previous results show that for linear channels with intersymbol interference (ISI), reduced-search decoding algorithms have near-maximum-likelihood error performance, but with much smaller complexity than the Viterbi decoder. Consequently, the controlled ISI introduced by a lowpass filter can be practically use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

    Publication Year: 1998, Page(s):714 - 729
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (714 KB)

    This paper presents an efficient trellis-based maximum-likelihood decoding algorithm for binary linear block codes. This algorithm is recursive in nature and is devised based on the structural properties and optimum sectionalization of a code trellis. The complexity of the proposed decoding algorithm is analyzed. Numerical results show that the proposed decoding algorithm significantly reduces the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interleaving schemes for multidimensional cluster errors

    Publication Year: 1998, Page(s):730 - 743
    Cited by:  Papers (52)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (573 KB)

    We present two-dimensional and three-dimensional interleaving techniques for correcting two- and three-dimensional bursts (or clusters) of errors, where a cluster of errors is characterized by its area or volume. Correction of multidimensional error clusters is required in holographic storage, an emerging application of considerable importance. Our main contribution is the construction of efficien... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time codes for high data rate wireless communication: performance criterion and code construction

    Publication Year: 1998, Page(s):744 - 765
    Cited by:  Papers (4988)  |  Patents (217)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (766 KB)

    We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted sig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shannon capacity of M-ary redundant multitrack runlength limited codes

    Publication Year: 1998, Page(s):766 - 774
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    We consider multiamplitude, multitrack runlength-limited (d, k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes. To compute capacity a constraint graph equivalent to the usual runlength-limited constraint graph is used. The introduced graph model has the vertex labeling independent of number ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tight upper bound on discrete entropy

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

    The standard upper bound on discrete entropy was derived based on the differential entropy bound for continuous random variables. A tighter discrete entropy bound is derived using the transformation formula of Jacobi theta function. The new bound is applicable only when the probability mass function of the discrete random variable satisfies certain conditions. Its application to the class of binom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplistic universal coding

    Publication Year: 1998, Page(s):778 - 781
    Cited by:  Papers (9)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (159 KB)

    A conceptually simple coding method may be described as follows. The source sequence is parsed into fixed-length blocks and a list of these blocks is placed in a dictionary. In the lossless case, the dictionary is transmitted and each successive block is encoded by giving its dictionary location. In the lossy case, the smallest collection of blocks such that every member of the dictionary is withi... 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