By Topic

IEEE Transactions on Information Theory

Issue 3 • May 1991

Filter Results

Displaying Results 1 - 25 of 64
  • Capacity of root-mean-square bandlimited Gaussian multiuser channels

    Publication Year: 1991, Page(s):453 - 465
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    Continuous-time additive white Gaussian noise channels with strictly time-limited and root-mean-square (RMS)-bandlimited inputs are studied. The capacity of the single-user and two-user RMS-bandlimited channels are found in easy-to-compute parametric forms and are compared to the classical formulas for the capacity of strictly bandlimited channels. In addition, channels are considered where the in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new outlook on Shannon's information measures

    Publication Year: 1991, Page(s):466 - 474
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The author presents a new approach to understanding the underlying mathematical structure of Shannon's information measures, which provides answers to the following two questions for any finite number of random variables. (1) For any information-theoretic identity, is there a corresponding set-theoretic identity via the formal substitution of symbols? (2) For any set-theoretic identity, is there a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically robust detection and estimation for very heavy-tailed noise

    Publication Year: 1991, Page(s):475 - 481
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (662 KB)

    The asymptotically robust detection of signals and the analogous problem of estimation of location are considered for noise distributions with heavier than exponential tails. The solution to both problems is identical and is obtained when using efficacy or asymptotic variance as the performance measure. The density of the noise is assumed to belong to a E-contamination class where the contaminant ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically efficient estimation of prior probabilities in multiclass finite mixtures

    Publication Year: 1991, Page(s):482 - 489
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    A prior probability estimator, a candidate for asymptotic efficiency, from within the class of recursive estimators proposed by the authors (1990) is synthesized. The authors prove asymptotic efficiency and convergence with probability one by involving a stochastic approximation theorem. The estimator can be implemented in practice for continuous, discrete, and mixed class conditional density func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On exponential bounds on the Bayes risk of the kernel classification rule

    Publication Year: 1991, Page(s):490 - 499
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The exponential, distribution-free bounds for the kernel classification rule are derived. The equivalence of all modes of the global convergence of the rule is established under optimal assumptions on the smoothing sequence. Also derived is the optimal global rate of convergence of the kernel regression estimate within the class of Lipschitz distributions. The rate is optimal for the nonparametric... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dithering and its effects on sigma-delta and multistage sigma-delta modulation

    Publication Year: 1991, Page(s):500 - 513
    Cited by:  Papers (59)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1107 KB)

    The spectrum of the quantization error in a dithered sigma-delta modulator is derived under the constraint that the dithering signal does not cause overload. The results apply to DC, sinusoidal, and more general quasi-stationary signals. It is shown in the case of a simple sigma-delta modulation that no-overload dithering can smooth the error spectrum and can make the quantization error asymptotic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct-sequence spread-spectrum multiple-access communications with random signature sequences: a large deviations analysis

    Publication Year: 1991, Page(s):514 - 527
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1312 KB)

    A direct-sequence spread-spectrum multiple-access bit-error probability analysis is developed using large-deviations theory. Let m denote the number of interfering spread-spectrum signals and let n denote the signature sequence length. Then the large deviations limit is as n to infinity with m fixed. A tight asymptotic expression for the bit-error probability is proven, and in addition, recent lar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of ternary Hebbian networks

    Publication Year: 1991, Page(s):528 - 534
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB)

    Networks of ternary neurons storing random vectors over the set (-1,0,1) by the so-called Hebbian rule are considered. It is shown that the maximal number of stored patterns that are equilibrium states of the network with probability tending to one as N tends to infinity is at least on the order of N2-1/ alpha /K, where N is the number of neurons, K is the number of nonzero elements in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The stability region of the finite-user slotted ALOHA protocol

    Publication Year: 1991, Page(s):535 - 540
    Cited by:  Papers (68)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (643 KB)

    A version of the discrete-time slotted ALOHA protocol operating with finitely many buffered terminals is considered. The stability region is defined to be the set of vectors of arrival rates lambda =( lambda 1,. . ., lambda M) for which there exists a vector of transmission probabilities such that the system is stable. It is assumed that arrivals are independent from slot to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic cellular automata with Gibbsian invariant measures

    Publication Year: 1991, Page(s):541 - 551
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1026 KB)

    A geometric characterization is given of a class of stochastic cellular automata, whose invariant probability measures are Gibbsian distributions (i.e. Markovian random fields). This class, whose members may be considered as the Cartesian product of convex polytopes with a finite number of vertices. contains all known automata of this type (e.g., the Metropolis, Gibbs sampler, and heat bath algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes

    Publication Year: 1991, Page(s):552 - 555
    Cited by:  Papers (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Tables of 1/p and rate (p-1 )/p binary quasi-cyclic (QC) codes that extend previously published results are presented. Many of these codes attain bounds given by T. Verhoeff (1987), who composed a table of bounds on the maximum possible minimum distance of binary linear codes. Many of the codes presented meet or improve these bounds. A best code is considered to be one which has the largest possib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal coding with minimum probability of codeword length overflow

    Publication Year: 1991, Page(s):556 - 563
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (674 KB)

    Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. The aim is to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv algorithm (1978) asymptotically attains the optimal performance in the sense just defined, independently of the source... View full abstract»

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

    Publication Year: 1991, Page(s):564 - 572
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (729 KB)

    An alphabetic code for an ordered probability distribution (Pk) is a prefix code in which Pk is assigned to the kth codeword of the coding tree in left-to-right order. This class of codes is applied to binary test problems. Several earlier results on alphabetic codes are unified and enhanced. The characteristic inequality for alphabetic codes that is analogous to the Kraft in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear inequalities for covering codes. I. Pair covering inequalities

    Publication Year: 1991, Page(s):573 - 582
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    The lower bounds on K(n,R), minimum number of codewords of any binary code of length n, and covering radius R are improved. A new technique combining the Hamming association scheme and the results of a classic problem of covering pairs by k-tuples is introduced. The new lower bounds are obtained by studying various linear inequalities satisfied by covering codes, and such an inequality is derived.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Which linear codes are algebraic-geometric?

    Publication Year: 1991, Page(s):583 - 602
    Cited by:  Papers (17)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1834 KB)

    An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If conditions are imposed on the degree of the divisor use, then criteria are derived for linear codes to be algebraic-geometric. In particular. the family of q-ary Hamming codes is investigated, and it is proven that only those with redundancy one or two and t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prime-phase sequences with periodic correlation properties better than binary sequences

    Publication Year: 1991, Page(s):603 - 616
    Cited by:  Papers (102)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1049 KB)

    For the case where p is an odd prime, n>or=2 is an integer, and omega is a complex primitive pth root of unity, a construction is presented for a family of pn p-phase sequences (symbols of the form omega i), where each sequence has length pn-1, and where the maximum nontrivial correlation value Cmax does not exceed 1+ square root pn. A complet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The merit factor of binary sequences related to difference sets

    Publication Year: 1991, Page(s):617 - 626
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (754 KB)

    Long binary sequences related to cyclic difference sets are investigated. Among all known constructions of cyclic difference sets it is shown that only sequences constructed from Hadamard difference sets can have an asymptotic nonzero merit factor. Maximal-length shift register sequences, Legendre, and twin-prime sequences are all constructed from Hadamard difference sets. The authors prove that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference

    Publication Year: 1991, Page(s):627 - 634
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (729 KB)

    A general class of trellis codes whose generating trellis can be labeled by a set of linear labels is defined. It is shown that for these codes there exist conditions on the signal mapping that make it possible to calculate the distance spectrum with respect to a distance measure (e.g., Euclidean distance) assuming an arbitrary correct sequence. This class of new codes contains most known trellis ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coding theorem for secret sharing communication systems with two Gaussian wiretap channels

    Publication Year: 1991, Page(s):634 - 638
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 KB)

    A coding theorem is proved for the secret sharing communication system (SSCS) with two Gaussian wiretap channels. This communication system is an extension of both the SSCS with two noiseless channels and the Gaussian wiretap channel (GWC). The admissible region of rates and security levels for the SSCS with two GWCs is described by the capacities and secrecy capacities of two GWCs. The following ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the tightness of two error bounds for decision feedback equalizers

    Publication Year: 1991, Page(s):638 - 639
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (190 KB)

    A new upper bound on the probability of error for decision feedback equalizers that is valid for serially independent and dependent stationary noise processes was presented by P. Kabaila (1987). It is shown that a bound of D.L. Duttweiler et al. (1974) is tighter than the bound of Kabaila when the noise component shows no serial dependence and with equalization over the full channel response lengt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a lower bound for the redundancy of reliable networks with noisy gates

    Publication Year: 1991, Page(s):639 - 643
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (513 KB)

    A proof is provided that a logarithmic redundancy factor is necessary for the reliable computation of the parity function by means of a network with noisy gates. This result was first stated by R.L. Dobrushin and S.I. Ortyukov (1977). However, the authors believe that the analysis given by Dobrushin and Ortyukov is not entirely correct. The authors establish the result by following the same steps ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exponential error bounds for random codes on Gaussian arbitrarily varying channels

    Publication Year: 1991, Page(s):643 - 649
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (611 KB)

    The main objective is to develop exponential bounds to the best error probability achievable with random coding on the Gaussian arbitrarily varying channel (GAVC) in the one case where a (strong) capacity exists (i.e., with peak time-averaged power constraints on both the transmitter and interference). The GAVC models a channel corrupted by thermal noise and by an unknown interfering signal of bou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new rate R=k/n (2

    Publication Year: 1991, Page(s):649 - 653
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (427 KB)

    Seven new systematic convolutional codes with good distance profiles, mostly of rates not previously investigated, have been found. New systematic convolutional codes of rates R=k/n, 4 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate k/(k+1) punctured convolutional encoders

    Publication Year: 1991, Page(s):653 - 655
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    G.D. Forney (1970, 1975) defined a minimal encoder as a polynomial matrix G such that G generates the code and G has the least constraint length among all generators for the code. Any convolutional code can be generated by a minimal encoder. High-rate k(k+1) punctured convolutional codes were introduced to simplify Viterbi decoding. An ordinary convolutional encoder G can be obtained from any punc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback codes with uniformly bounded codeword lengths and zero-error capacities

    Publication Year: 1991, Page(s):655 - 660
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (639 KB)

    A certain class of variable-length codes with feedback whose codeword lengths are uniformly upper bounded is considered. For this class of variable-length codes, it is shown that the zero-error capacity region for the, single-user and multiuser channels with feedback can be extended up to the ordinary average-error capacity under some conditions, if variable-length codes (semiblock codes) are used... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering