Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 4 • July 1989

Filter Results

Displaying Results 1 - 25 of 29
  • Sixty-phase generalized Barker sequences

    Publication Year: 1989, Page(s):911 - 912
    Cited by:  Papers (24)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (198 KB)

    The extension of the list of known generalized Barker sequences to length 19 is proposed. Examples for all lengths up to 19 where the terms of the sequence are sixtieth roots of unity are given.<> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Permutation polynomials and nonsingular feedback shift registers over finite fields

    Publication Year: 1989, Page(s):900 - 902
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    A necessary and sufficient condition is established for nonsingularity of a feedback shift-register of degree at most two over a finite field. Several relations between permutation polynomials and nonsingular feedback shift-registers over finite fields are also studied. Four theorems are given and discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multistage sigma-delta modulation

    Publication Year: 1989, Page(s):784 - 796
    Cited by:  Papers (84)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    A theoretical basis is provided for multistage sigma-delta modulation (MSM), which is a cascade realization of several single-loop sigma-delta modulators with a linear combinatorial network. Equations are derived describing the output and the quantization noise of MSM for an arbitrary input signal, and the noise-shaping characteristic of MSM is investigated. The spectral characteristics of an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on Hansmann's 1934 family of distributions

    Publication Year: 1989, Page(s):910 - 911
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    The family of distributions introduced by G.H. Hansmann in 1934 is considered. Apparently, it has gone unnoticed for over fifty years that there is a major error in Hansmann's work and that his solutions are incomplete in some cases. It is shown how to complete them and the necessity of doing so is demonstrated by means of two examples View full abstract»

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

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

    Bounds on the rates of intersecting Goppa codes are derived and compared with previous bounds on intersecting codes. Intersecting, self-intersecting, and highly intersecting Goppa codes are discussed in detail. It is shown that asymptotically good intersecting Goppa codes exist and lower bounds are given on their rates. Six theorems for Goppa codes are also presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds and construction for difference triangle sets

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

    The definition of difference triangle sets (DTSs) and is short survey of some of their important applications is given. A lower bound on the maximal element in any (I, J)-(DTS) is then given, and a construction of DTSs is described. Finally, tables of the best known lower and upper bounds on optimal DTSs are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal type-B1 convolutional codes of rate 4/5

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    It is reported that two optimal type-B1 burst correcting convolutional codes of rate 4/5 were found by computer search. The B 0 matrices of these codes are given. In octal, the columns are written as (53,357,756,1555,1000) and (53,357,1555,1203,1000), respectively View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic properties of an adaptive beam former algorithm

    Publication Year: 1989, Page(s):859 - 867
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    The asymptotic properties of a recursive adaptive beam former algorithm are studied. Both decreasing-gain and constant-gain cases are treated. For the case of decreasing gain the mean square convergence result is obtained, whereas for constant gain a sharp bound is derived, and asymptotic analysis for the normalized error is carried out. The analysis provides a clear picture of the local behaviour... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of channels with unknown interference

    Publication Year: 1989, Page(s):770 - 783
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1108 KB)

    The process of communicating in the presence of interference that is unknown or hostile is modeled as a two-person zero-sum game with the communicator and the jammer as the players. The objective function considered is the rate of reliable communication. The communicator's strategies are encoders and distributions on a set of quantizers. The jammer's strategies are distributions on the noise power... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bounded-distance decoding algorithm for the Leech lattice, with generalizations

    Publication Year: 1989, Page(s):906 - 909
    Cited by:  Papers (57)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    An algorithm is given that decodes the Leech lattice with not much more than twice the complexity of soft-decision decoding of the Golay code. The algorithm has the same effective minimum distance as maximum-likelihood decoding and increases the effective error coefficient by less than a factor or two. The algorithm can be recognized as a member of the class of multistage algorithms that are appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction and decoding of a class of algebraic geometry codes

    Publication Year: 1989, Page(s):811 - 821
    Cited by:  Papers (68)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH decoder... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two results on the permuting mailbox channel

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

    Two problems of information transmission on the permuting mailbox (or relay) channel are considered. Such a channel is characterized by the cardinality ε of the alphabet and the number b of letters in the mailbox. In the case b=1, an upper bound is obtained on the achievable rate in the jamming situation. In the case ε=2, it is proven that time-sharing is not always the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Degradation of signal-to-noise ratio due to amplitude distortion

    Publication Year: 1989, Page(s):874 - 878
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    The effect of filtering on the signal-to-noise ratio (SNR) of a coherently demodulated band-limited signal is determined in the presence of worst-case amplitude ripple. The problem is formulated as an optimization in the Hilbert space L2. The form of the worst-case amplitude ripple is specified, and the degradation in the SNR is derived in closed form. It is shown that, when th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • More on the decoder error probability for Reed-Solomon codes

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

    A combinatorial technique similar to the principle of inclusion and exclusion is used to obtain an exact formula for PE (u), the decoder error probability for Reed-Solomon codes. The PE(u) for the (255, 223) Reed-Solomon code used by NASA and for the (31, 15) Reed-Solomon code (JTIDS code) are calculated using the exact formula and are obse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal buffer allocation problem

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

    Pathwise probabilistic arguments are used to justify a simple rule of thumb by which buffer allocation can be carried out. The model for the underlying network is the skeleton of an open Jackson network. The problem of how to distribute in the best possible way a fixed number N of available buffer spaces among the nodes of the network is considered. The goal is to optimize some performanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust large deviations performance analysis for large sample detectors

    Publication Year: 1989, Page(s):917 - 920
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    Large deviations theory is used to analyze the exponential rate of decrease of error probabilities for a sequence of decisions based on a test statistics sequence {Tn}. It is assumed that (for a given statistical hypothesis) the distributions of Tn are determined by some unknown member of a class of probability distributions. The worst case, or least favorab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds on estimator performance for energy-invariant parameters of multidimensional Poisson processes

    Publication Year: 1989, Page(s):843 - 858
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1100 KB)

    Using rate distortion theory, lower bounds are developed for the mean-square error of estimates of a random parameter of an M-dimensional inhomogeneous Poisson process with respect to which the energy, i.e. the average number of points, is invariant. The bounds are derived without stringent assumptions on either the form of the intensity or the prior distribution of the parameter, and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and decoding rules for classes of arbitrarily varying channels

    Publication Year: 1989, Page(s):752 - 769
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1468 KB)

    The capacity of an arbitrarily varying channel (AVC) is considered for deterministic codes with the average probability of error criterion and, typically, subject to at state constraint. First, sufficient conditions are provided that enable relatively simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy) OR channel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the influence of coding on the mean time to failure for degrading memories with defects

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

    The application of a combined test-error-correcting procedure is studied to improve the mean time to failure (MTTF) for degrading memory systems with defects. The degradation is characterized by the probability p that within a unit of time a memory cell changes from the operational state to the permanent defect state. Bounds are given on the MTTF and it is shown that, for memories with View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds and constructions for codes correcting unidirectional errors

    Publication Year: 1989, Page(s):797 - 810
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    A brief introduction is given on the theory of codes correcting unidirectional errors, in the context of symmetric and asymmetric error-correcting codes. Upper bounds on the size of a code of length n correcting t or fewer unidirectional errors are then derived. Methods in which codes correcting up to t unidirectional errors are constructed by expurgating t-fold... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Private-key algebraic-code encryptions

    Publication Year: 1989, Page(s):829 - 833
    Cited by:  Papers (23)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    An approach to private-key cryptosystems is proposed which allows use of very simple codes of distance ⩽6 and length of 250 bits or less. This scheme not only gives very efficient encoding/decoding and very high information rates but also appears to be secure even under chosen-plaintext attacks. Several other previously published public-key cryptosystems are also discussed and analyzed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple proof of the concavity of the entropy power with respect to added Gaussian noise

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

    A very simple proof of M.H. Costa's result (see ibid., vol.IT-31, p.751-60, 1985) that the entropy power of Xt=X +N(O,tI) is concave in t, is derived as an immediate consequence of an inequality concerning Fisher information. This relationship between Fisher information and entropy is found to be useful for proving the central limit theorem. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Slepian process of a random Gaussian trigonometric polynomial

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

    It is proved that the Slepian process of a stationary trigonometric polynomial with Gaussian coefficients has a Karhunen-Loeve expansion consisting of a finite number of terms, and that each eigenfunction is itself a finite trigonometric polynomial. Upper bounds for the error which results when replacing the Slepian process corresponding to a general Gaussian stationary process by the Slepian proc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric characterization of capacity-constraint function

    Publication Year: 1989, Page(s):892 - 895
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Maximizing the mutual information under a linear input constraint is considered from a geometric point of view. Assuming a suitable regularity condition on the channel matrix, it is found that the probability distribution (PD) equidistant from the row PDs of the channel matrix plays an important role, and the maximum is achieved by the projection of that PD onto the set of PDs satisfying the const... View full abstract»

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

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

    The initial vector problem is considered for group codes for the Gaussian channel and, in particular, for codes generated by permutation groups. Variant I and variant II permutation codes are defined, and optimal initial vectors for these codes are constructed. A numerical algorithm for constructing optimal group codes is presented together with examples of this algorithm applied to several permut... 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