IEEE Transactions on Information Theory

Issue 3 • May 1989

Filter Results

Displaying Results 1 - 25 of 29
  • Optical orthogonal codes: design, analysis and applications

    Publication Year: 1989, Page(s):595 - 604
    Cited by:  Papers (709)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    An optical orthogonal code (OOC) is a family of (0,1) sequences with good auto- and cross-correlation properties, i.e the autocorrelation of each sequence exhibits the `thumbtack' shape and the cross correlation between any two sequences remains low throughout. The use of optical orthogonal codes enables a large number of asynchronous users to transmit information efficiently and reliably. The thu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized Euclidean algorithm for multisequence shift-register synthesis

    Publication Year: 1989, Page(s):584 - 594
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The problem of finding a linear-feedback shift register of shortest length capable of generating prescribed multiple sequences is considered. A generalized Euclidean algorithm, which is based on a generalized polynomial division algorithm, is presented. A necessary and sufficient condition for the uniqueness of the solution is given. When the solution is not unique, the set of all possible solutio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multilevel approach to the design of DC-free line codes

    Publication Year: 1989, Page(s):579 - 583
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    A multilevel approach to the design of DC-free line codes is presented. The different levels can be used for different purposes, for example, to control the maximum accumulated charge or to guarantee a certain minimum distance. The advantages of codes designed by this method over similar codes are the improved run-length/accumulated-charge parameters, higher transmission rate, and the systematic n... View full abstract»

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

    Publication Year: 1989, Page(s):572 - 578
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    The coding theorem is proved for the system with two noisy channels, each of which is a broadcast channel. It is assumed that the legitimate channel is less noisy than the wiretapped channel. The admissible region of rates and security levels is obtained completely. The relationship of the present results to previous results is examined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on multiset decipherable codes

    Publication Year: 1989, Page(s):662 - 663
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    In a recent paper A. Lempel (ibid., vol.IT-32, p.714-16, 1986) introduced the notion of a multiset decipherable (MSD) code to handle some special problems of information transmission. He showed that no MSD code contains a full prefix code as a proper subcode; he further conjectured that no MSD code contains a full uniquely decipherable code as a proper subcode and that every MSD code satisfies the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable computation by networks in the presence of noise

    Publication Year: 1989, Page(s):569 - 571
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Lower bounds on the depth of Boolean networks that can compute reliably in the presence of randomly occurring failures are proved. A bound is also given on the reliability that error-tolerant networks can achieve: this bound implies a limit strictly smaller than 1/2 on the failure probability per gate that can be tolerated. The results improve upon recently published bounds of N. Pippenger (ibid.,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels

    Publication Year: 1989, Page(s):698 - 700
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    The binomial group-testing problem consists of finding by group tests all defectives in a given set of items, each of which independently has probability p of being defective. The conjecture that the expected number of tests under an optimal testing algorithm is nondecreasing in p has recently been proved by transplanting the probability structure of the set of defective items. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Entropy expressions and their estimators for multivariate distributions

    Publication Year: 1989, Page(s):688 - 692
    Cited by:  Papers (66)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    Entropy expressions for several continuous multivariate distributions are derived. Point estimation of entropy for the multinormal distribution and for the distribution of order statistics from D.G. Weinman's (Ph.D dissertation, Ariz. State Univ., Tempe, AZ, 1966) exponential distribution is considered. The asymptotic distribution of the uniformly minimum variance unbiased estimator for multinorma... View full abstract»

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

    Publication Year: 1989, Page(s):659 - 662
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    The performance of trellis codes is determined by their minimum Euclidean distance. Upper bounds on this minimum distance valid for phase-shift-keyed (PSK) signals that improve on previously derived bounds are derived. Although the bound is valid only for PSK signals, the bounding techniques developed here can be extended to other equal-energy configurations and hence could pave the way to obtaini... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear and logarithmic capacities in associative neural networks

    Publication Year: 1989, Page(s):558 - 568
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    A model of associate memory incorporating global linearity and pointwise nonlinearities in a state space of n-dimensional binary vectors is considered. Attention is focused on the ability to store a prescribed set of state vectors as attractors within the model. Within the framework of such associative nets, a specific strategy for information storage that utilizes the spectrum of a linea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating the information content of symbol sequences and efficient codes

    Publication Year: 1989, Page(s):669 - 675
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Several variants of an algorithm for estimating Shannon entropies of symbol sequences are presented. They are all related to the Lempel-Ziv algorithm (1976, 1977) and to recent algorithms for estimating Hausdorff dimensions. The average storage and running times increase as N and Nlog N, respectively, with the sequence length N. These algorithms proceed basicall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative convex I-projection algorithms for maximum entropy and minimum cross-entropy computations

    Publication Year: 1989, Page(s):695 - 698
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    General multiple-constraint minimum-cross-entropy and maximum-entropy problems can be solved by the iterative solution of single constraint subproblems. Existing theoretical results justify iterative I-projection algorithms that may be computationally expedient in some cases. An iterative algorithm for J.E. Shore's (ibid., vol.IT-28, no.6, p.956-61, Nov. 1982) minimum cross-entropy spectral analys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new method for evaluating the log-likelihood gradient, the Hessian, and the Fisher information matrix for linear dynamic systems

    Publication Year: 1989, Page(s):682 - 687
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    A method is presented for evaluating the log-likelihood gradient (score), the Hessian, and the Fisher information matrix of the parameters of linear dynamic stochastic systems. The method incorporates the optimal Kalman smoothing equations and is therefore ideal for simultaneous state estimation and parameter identification. The result can be used for efficient implementation of gradient-based alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary cyclic [n,k] codes used for simultaneous tEC and SBD

    Publication Year: 1989, Page(s):657 - 659
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    In a hybrid forward-error-correction-automatic-repeat-request system one may wish to use an [n,k] cyclic code because its decoding algorithm is well known. An analytic formula is given for determining the fraction of undetectable single bursts of different lengths when a cyclic code is used for simultaneous single-burst-error detection and t-random error correction View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Light traffic derivatives via likelihood ratios

    Publication Year: 1989, Page(s):648 - 654
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    The steady-state behavior of open queuing systems with Poisson arrival processes in light traffic, that is, as the arrival rate tends to zero, is considered. Expressions are provided for the derivatives with respect to the arrival rate of various quantities of interest (such as moments of steady-state sojourn times and queue lengths), evaluated at an arrival rate of zero. These expressions are obt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The helical window token ring

    Publication Year: 1989, Page(s):626 - 636
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    An access rule for token ring local-area networks called the helical-window token-ring protocol is introduced. It features the use of a window that limits the allowable messages a token-holding station can send. With the window, the operation of the protocol approaches that of a central single-server queuing system in the sense that messages are delivered in near first-come-first-served order on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On nonuniform sampling expansions using entire interpolating functions, and on the stability of Bessel-type sampling expansions

    Publication Year: 1989, Page(s):549 - 557
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The author has extended the work of N. Levinson (1940) to derive nonuniform sampling expansions that are stable in the sense of K. Yao and J.B. Thomas (IEEE Trans. Circuit Theory, vol.CT-14, p.404-8, 1967) and reduce to Bessel-type sampling expansions for a particular choice of the sampling sequence View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized sequential detection

    Publication Year: 1989, Page(s):509 - 520
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    A class of decentralized sequential detection problems is investigated. Under appropriate independence assumptions, it is shown that at each time instant the optimal local strategies are given by threshold tests on the likelihood of ratios. Furthermore, local decisions depend not only on the present and past observations, but on the past local decision as well. That is, for each local processor a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-access channels with memory with and without frame synchronism

    Publication Year: 1989, Page(s):605 - 619
    Cited by:  Papers (63)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    The capacity region of frame-synchronous and frame-asynchronous, discrete, two-user multiple-access channels with finite memory is obtained. Frame synchronism refers to the ability of the transmitters to send their code words in unison. The absence of frame synchronism in memoryless multiple-access channels is known to result in the removal of the convex hull operation from the expression of the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On write-unidirectional memory codes

    Publication Year: 1989, Page(s):663 - 669
    Cited by:  Papers (29)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Write-unidirectional memories generalize write-once memories storing binary sequences of some fixed length in a reusable manner. At every new usage the content of the memory can be rewritten by either changing some of the zeroes to ones or changing some of the ones to zeroes, but not both. The author constructs codes of rate 0.5325. He discusses the four cases that arise according to whether or no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonstationary moments of a random binary pulse train

    Publication Year: 1989, Page(s):700 - 703
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    A method for finding the nonstationary moments of a random binary pulse train with arbitrary pulse shape is described and used to find the joint moments of the pulse train with a delayed version of itself. These moments are used in the analysis of nonlinear synchronization circuits. The method uses the moment generating function and a recursive relationship for moments and cumulants. Example deriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The power spectral density of maximum entropy charge constrained sequences

    Publication Year: 1989, Page(s):692 - 695
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    A limit on the absolute value of the running digital sum of a sequence is known as the charge constraint. Such a limit imposes a spectral null at DC. The maximum-entropy distribution of a charge-constrained sequence is presented. A closed-form expression for the power spectral density of maximum-entropy charge-constrained sequences is given and plotted View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Immittance-domain Levinson algorithms

    Publication Year: 1989, Page(s):675 - 682
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Several computationally efficient versions of the Levinson algorithm for solving linear equations with Toeplitz and quasi-Toeplitz matrices are presented, motivated by a new stability test. The new versions require half the number of multiplications and the same number of additions as the conventional form of the Levinson algorithm. The saving is achieved by using three-term (rather than two-term)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of non-Reed-Solomon type MDS codes

    Publication Year: 1989, Page(s):655 - 657
    Cited by:  Papers (3)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A construction is presented of long maximum-distance-separable (MDS) codes that are not generalized Reed-Solomon (GRS) type. The construction uses subsets S,|S|=m of a finite field F=GF(q) with the property that no t distinct elements of S add up to some fixed element of F . Large subsets of this kind are used to construct [ View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message delay analysis of multiclass priority TDMA, FDMA, and discrete-time queueing systems

    Publication Year: 1989, Page(s):637 - 647
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    A multiplexing communications channel is considered. The network stations share the channel on a time-division multiple-access (TDMA) basis or by using a slotted frequency-division multiple-access (FDMA) scheme. Messages are categorized by their differing priorities. Two service disciplines are considered: nonpreemptive and preemptive-resume. A discrete-time priority queuing system is introduced a... 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
Prakash Narayan 

Department of Electrical and Computer Engineering