IEEE Transactions on Information Theory

Volume 34 Issue 5  Part 1 • Sept. 1988

Filter Results

Displaying Results 1 - 25 of 56
  • A knapsack-type public key cryptosystem based on arithmetic in finite fields

    Publication Year: 1988, Page(s):901 - 909
    Cited by:  Papers (65)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (895 KB)

    A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their size in bits. In particular, the density can be made high enough to foil so-called low-den... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Link scheduling in polynomial time

    Publication Year: 1988, Page(s):910 - 917
    Cited by:  Papers (326)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (785 KB)

    Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network. The constraint on conversations is that each station can converse with only one other station at a time. The first algorithm is strongly polynomial and finds a schedule of minimum length that allows each pair of neighboring stations to converse directly for a prescribed length of time. The sec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the stability of interacting queues in a multiple-access system

    Publication Year: 1988, Page(s):918 - 930
    Cited by:  Papers (227)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1010 KB)

    The standard discrete-time slotted ALOHA system with a finite number of buffered terminals is considered. The stability (ergodicity) region for this system is known only for the case of two terminals and for the case of any number of symmetric terminals. The stability of the system is studied by means of a simple concept of dominance. It is shown that the stability region for the case of two termi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay analysis of the n-ary stack random-access algorithm

    Publication Year: 1988, Page(s):931 - 942
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1013 KB)

    An analysis is presented of the delay performance of the n-ary stack algorithm, an easy-to-implement random-access algorithm that uses collision-no-collision binary feedback and requires only limited feedback sensing by the users. Utilizing the regenerative character of the stochastic processes that are associated with the random-access system, tight upper and lower bounds on the mean packet delay... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signal detection in fractional Gaussian noise

    Publication Year: 1988, Page(s):943 - 959
    Cited by:  Papers (83)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1181 KB)

    Several results related to the reproducing kernel Hilbert space of fractional Brownian motion are presented to facilitate the study of signal detection in additive fractional Gaussian noise. This Hilbert space is completely characterized, and an alternative characterization for the restriction of this class of functions to a compact interval (0.T) is given. Infinite- and finite-interval whitening ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fine quantization in signal detection and estimation

    Publication Year: 1988, Page(s):960 - 972
    Cited by:  Papers (62)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1015 KB)

    The performance lost to data quantization in signal detection and estimation procedures is considered. The performance is measured by f-divergences, which are useful indices of discrimination information between statistical hypotheses. Some properties of the f-divergences are briefly discussed, and a general result for the loss in divergence due to uniform data quantization is obtained. Several ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stochastic multisample extension of Morris's robust detector in bounded amplitude noise

    Publication Year: 1988, Page(s):973 - 978
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    A Bayesian approach to the problem of finite sample detection of a signal in an unknown noise environment is formulated. A mathematical solution is given for the minimax (robust) test for detecting the presence of a stochastic signal of known prior probability in unknown additive noise of bounded magnitude. This solution remains valid for a constant signal with identical components when the additi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision tree design from a communication theory standpoint

    Publication Year: 1988, Page(s):979 - 994
    Cited by:  Papers (40)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1378 KB)

    A communication theory approach to decision tree design based on a top-town mutual information algorithm is presented. It is shown that this algorithm is equivalent to a form of Shannon-Fano prefix coding, and several fundamental bounds relating decision-tree parameters are derived. The bounds are used in conjunction with a rate-distortion interpretation of tree design to explain several phenomena... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of a vector Gaussian arbitrarily varying channel

    Publication Year: 1988, Page(s):995 - 1003
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (661 KB)

    The random coding capacity of a vector Gaussian arbitrarily varying channel (VGAVC) is determined, along with a simple general method for computing this capacity. The VGAVC is a discrete-time memoryless vector channel with an input power constraint and additive Gaussian noise that is further corrupted by an additive jamming signal. The statistics of this jamming signal are unknown and can be arbit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On calculating the capacity of an infinite-input finite (infinite)-output channel

    Publication Year: 1988, Page(s):1004 - 1010
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB)

    A version of the Arimoto-Blahut algorithm for continuous channels involves evaluating integrals over an entire input space and thus is not tractable. Two generalized discrete versions of the Arimoto-Blahut algorithm are presented for this purpose. Instead of calculating integrals, both algorithms require only the computation of a sequence of finite sums. This significantly reduces numerical comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes

    Publication Year: 1988, Page(s):1011 - 1020
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    A lower bound on the minimum free Euclidean distance of trellis-coded modulation (TCM) is derived that guarantees the existence of good TCM codes of any complexity. The bound is used to compare trellis codes combined with phase-shift keying, pulse amplitude modulation, and quadratic amplitude-shift keying modulation. This random coding bound is the first lower bound on the free distance of trellis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrum, distance, and receiver complexity of encoded continuous phase modulation

    Publication Year: 1988, Page(s):1021 - 1032
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1106 KB)

    A comparison of different classes of encoded continuous phase modulation (CPM) schemes is presented. In terms of joint power-bandwidth performance, it is found that coded eight-level systems are better than coded four-level systems and that partial-response signalling is better than full-response signalling. In general, the price paid for better performance is increased receiver complexity. Heuris... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic minimum discrimination information measure for asymptotically weakly stationary processes

    Publication Year: 1988, Page(s):1033 - 1040
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (785 KB)

    An explicit expression is derived for the minimum discrimination information (MDI) measure with respect to Gaussian priors for sources characterized by their mean and by any principal leading block of their covariance matrix. An explicit expression is provided for the MDI extension of the given partial covariance of the source with respect to a Gaussian prior. For zero-mean sources and zero-mean G... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the filtering of noise-contaminated signals observed via hard limiters

    Publication Year: 1988, Page(s):1041 - 1048
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The problem of signal estimation from a measurement of its noise crossings is considered, following a nonlinear filtering approach that is different from the classical Davenport method. By focusing on a specific noise model and applying recent results on the excursions of a Brownian motion, an exact representation of the optimal filter is derived. Various extensions of the results are considered.&... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal trellises for block codes

    Publication Year: 1988, Page(s):1049 - 1053
    Cited by:  Papers (126)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (597 KB)

    Basic concepts in the study of trellises of block codes are defined. It is shown that minimal proper trellises exists for all block codes. Bounds on the size of such trellises are established. These bounds are shown to be exact for maximum distance separable codes and nearly so for perfect codes.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The root lattices as low bit rate vector quantizers

    Publication Year: 1988, Page(s):1053 - 1058
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (610 KB)

    Vector quantizers based on the A and D lattices are explored, using the mean square error (MSE) fidelity criterion for independent identically distributed sources with normal, Laplacian, and gamma probability density functions. Code books are studied for uniform coding rates of up to 2 b/sample and two and four dimensions. The expected MSE performance of the quantizers is better than that of optim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sequential decoding for the Gilbert channel

    Publication Year: 1988, Page(s):1058 - 1061
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (431 KB)

    It is well known that the computational performance of sequential decoding deteriorates greatly when channel errors occur in clusters, as in Gilbert channels. A way of using sequential decoding to exploit the memory of a Gilbert channel that alleviates this problem is presented. A Fano-like metric matched to this channel is used. The method is investigated by simulating sequential decoding utilizi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple burst-correcting array codes

    Publication Year: 1988, Page(s):1061 - 1066
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (597 KB)

    Two families of binary linear multiple-burst-correcting array codes are presented. The codes consist of all possible n/sub 1/*n/sub 2/ arrays over GF(2), where the columns have even parity and the rows belong to any given code of length n/sub 2/ and minimum distance 2t. It is shown that if the bits are read out diagonally instead of horizontally, each diagonal followed by the preceding one (viewed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A geometric approach to the maximum likelihood spectral estimator for sinusoids in noise

    Publication Year: 1988, Page(s):1066 - 1070
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (522 KB)

    The problem of estimating sinusoids that have been corrupted by additive stationary noise is addressed. It is shown how the Naimark dilation for the data correlation sequence can be used to provide additional insight into some fundamental results on orthogonal polynomials and to give a new interpretation of the maximum-likelihood (ML) spectral estimator.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero error capacity under list decoding

    Publication Year: 1988, Page(s):1070 - 1074
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (659 KB)

    Shannon's zero-error channel capacities C/sub OF/, C/sub O/ with and without noiseless feedback are generalized to list decoding: the receiver lists L messages, erring if the correct one is not listed. The corresponding capacities C/sub OF/(L), C/sub O/(L) are nondecreasing in L. For an I-letter input alphabet, C/sub OF/(L) attains its maximum at L=I-1. A lower bound to C/sub O/(L) approaches that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum length error event of minimum Euclidean weight

    Publication Year: 1988, Page(s):1074 - 1076
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (350 KB)

    Let eta denote the length of the shortest error event achieving the minimum detection distance of maximum-likelihood signal detection for an impulse response having memory v. A family of impulse responses where eta is of order v/sup 2/ is exhibited. This, in turn, shows that some difficulty can arise in computing the minimum detection distance.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the linear complexity of nonuniformity decimated PN-sequences

    Publication Year: 1988, Page(s):1077 - 1079
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    A lower bound is derived on the probability that when a PN-sequence of period N=2/sup n/-1 is nonuniformly decimated by means of a sequence whose period divides M, the decimated sequence will have maximum linear complexity nM. It is shown that by choosing M and n appropriately, this probability can be made arbitrarily close to one with nM arbitrarily large.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding

    Publication Year: 1988, Page(s):1079 - 1081
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (322 KB)

    Punctured convolutional codes with good performance are reported for rates (n-1)/n with n=5, 6, 7, 8 and constraint lengths k=2, 3, . . ., 6. The tabulated codes are nonsystematic binary convolutional codes with maximum free distance and minimum information weight, for use with soft-decision Viterbi decoding.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A large deviation theory proof of the abstract alphabet source coding theorem

    Publication Year: 1988, Page(s):1081 - 1083
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (335 KB)

    A modified proof of T. Berger's (1971) abstract alphabet source coding with a fidelity criterion theorem is provided, utilizing a variant of a result from large deviation theory. This proof does not use an asymptotic equipartition property of any kind, thus providing what appears to be a more direct approach to this key result.<<ETX>> View full abstract»

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

    Publication Year: 1988, Page(s):1083 - 1089
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the ... 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