IEEE Transactions on Information Theory

Issue 4 • July 1984

Filter Results

Displaying Results 1 - 22 of 22
  • In Memoriam: Robert Tienwen Chien (1931 - 1983)

    Publication Year: 1984, Page(s):583 - 586
    Request permission for commercial reuse | PDF file iconPDF (586 KB)
    Freely Available from IEEE
  • Fast evaluation of logarithms in fields of characteristic two

    Publication Year: 1984, Page(s):587 - 594
    Cited by:  Papers (83)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1363 KB)

    A method for determining logarithms in GF(2^{n})is presented. Its asymptotic running time isO(exp (cn^{1/3} log^{2/3} n))for a small constantc, while, by comparison, Adleman's scheme runs in timeO(exp (c^{'}n^{1/2} log^{1/2} n )). The ideas give a dramatic improvement even for moderate-sized fields such as GF(2^{127}), and make (barely) possib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A critical analysis of the security of knapsack public-key algorithms

    Publication Year: 1984, Page(s):601 - 611
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1882 KB)

    The authors claim that the security of the Merkle-Hellman algorithm is greatly exaggerated. First, any enciphering key that is obtained from a superincreasing sequence has infinitely many superincreasing deciphering keys that can decipher all messages. This follows from the fact that the conditions on the transformation^{ast} w bmod mrequirew/mto lie in a restricted set of in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distribution of de Bruijn sequences of given complexity

    Publication Year: 1984, Page(s):611 - 614
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (571 KB)

    The distributiongamma (c, n)of de Bruijn sequences of ordernand linear complexitycis investigated. It is shown that forn geq 4, gamma (2^{n} - 1, n) equiv 0 pmod{8}, and fork geq 3, gamma (2^{2k} - 1,2k) equiv 0 pmod{l6}. It is also shown thatgamma (c, n) equiv 0 pmod{4}for allc, andn geq 3such thatcn View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum waveform signal sets with amplitude and energy constraints

    Publication Year: 1984, Page(s):615 - 622
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (915 KB)

    It is desirable to choose the waveforms making up a signaling alphabet so that they are maximally separated one from another. This problem is considered, in the space of square-integrable functions, for signals which have finite duration, and are constrained in the ranges of their values as well as in energy. Corresponding to each of the following cases, we establish sharp bounds for the minimum d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The continued fraction as an information source (Corresp.)

    Publication Year: 1984, Page(s):671 - 674
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (673 KB)

    Nearly every digit (positive-integer partial quotient) of the simple continued fraction representing a random number carries3.4325bits of information about the number. This is reduced by 0.0081 bit if the preceding digit is already known and by a further0.0007bit if the second preceding digit is also known, Any finite sequence of digits is equally likely to occur forward and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the aperiodic autocorrelation function for a maximal-length sequence (Corresp.)

    Publication Year: 1984, Page(s):685 - 687
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB)

    The magnitude of the out-of-phase aperiodic autocorrelation function for a maximal-length linear feedback shift register sequence of periodNis at most1 + (2/ pi)(N + 1)^{1/2} ln(4N/ pi). Previously, the best upper bound was(N + 1)^{1/2} ln (eN). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Review of ́Information Theory: Coding Theorems for Discrete Memoryless Systemś (Csiszár, I., and Körner, J.; 1981)

    Publication Year: 1984, Page(s):693 - 694
    Request permission for commercial reuse | PDF file iconPDF (370 KB)
    Freely Available from IEEE
  • Review of 'Secure Communications and Asymmetric Cryptosystems' (Simmons, G.J., Ed.; 1982)

    Publication Year: 1984, Page(s): 694
    Request permission for commercial reuse | PDF file iconPDF (164 KB)
    Freely Available from IEEE
  • Review of 'Digital Picture Processing,' 2nd edn. (Rosenfeld, A., and Kak, A.C.; 1982)

    Publication Year: 1984, Page(s):694 - 695
    Request permission for commercial reuse | PDF file iconPDF (391 KB)
    Freely Available from IEEE
  • Analysis of a new nonlinear filter and tracking methodology (Corresp.)

    Publication Year: 1984, Page(s):677 - 681
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A recursive nonlinear filter and tracking methodology is developed for a class of partially observable processes with an approximating model which is linear in the unobservable states and initially has the unobservables conditionally Gaussian with respect to the observations. The usual model smoothness is not required, and applications to simulated tracking problems show the filter to be considera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Wiener filtering for multiple inputs with channel distortion (Corresp.)

    Publication Year: 1984, Page(s):674 - 677
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Robust Wiener filtering has previously been considered for the single-input (scalar) case where there is no channel distortion and where the signal to be estimated is the source signal itself. Here, these results are extended to the multiple-input (vector) case where linear channel distortion is allowed and the signal to be estimated is a linear-filtered version of the source signal. The results a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless inverse scattering, digital filters, and estimation theory

    Publication Year: 1984, Page(s):644 - 662
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2656 KB)

    Methods to construct rational solutions of the lossless inverse scattering (LIS) problem for one-port passive digital systems are described. The first method is recursive and can be viewed as a generalization of the celebrated Schur algorithm. The second method is global and leads to a parametrization of what we call fundamental solutions from which all LIS solutions may be constructed. Quite a fe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maxentropic Markov chains (Corresp.)

    Publication Year: 1984, Page(s):665 - 667
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The Markov chain that has maximum entropy for given first and second moments is determined. The solution provides a discrete analog to the continuous Gauss-Markov process. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal coding, information, prediction, and estimation

    Publication Year: 1984, Page(s):629 - 636
    Cited by:  Papers (455)  |  Patents (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1440 KB)

    A connection between universal codes and the problems of prediction and statistical estimation is established. A known lower bound for the mean length of universal codes is sharpened and generalized, and optimum universal codes constructed. The bound is defined to give the information in strings relative to the considered class of processes. The earlier derived minimum description length criterion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An achievable region and outer bound for the Gaussian broadcast channel with feedback (Corresp.)

    Publication Year: 1984, Page(s):667 - 671
    Cited by:  Papers (90)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A deterministic coding scheme is presented for additive white Gaussian broadcast channels with two receivers and feedback from the receivers to the transmitter. The region of data rates at which reliable communication is possible is larger than that of the corresponding channel without feedback. This is the first example showing that the capacity region of degraded broadcast channels can be enlarg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some complexity results about packet radio networks (Corresp.)

    Publication Year: 1984, Page(s):681 - 685
    Cited by:  Papers (143)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    It is shown that the decision problem regarding the membership of a point in the capacity region of a packet radio network is nondeterministic polynomial time hard (NP hard). The capacity region is the set of all feasible origin-to-destination message rates where feasibility is defined as the existence of any set of rules for moving the data through the network so that the desired rates are satisf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme

    Publication Year: 1984, Page(s):594 - 601
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    The basic Merkle-Hellman additive trapdoor knapsack public-key cryptosystem was recently shown to be insecure, and attacks have also been developed on stronger variants of it, such as the Graham-Shamir system and the iterated knapsack cryptosystem. It is shown that some simple variants of another Merkle-Hellman system, the multiplicative knapsack cryptosystem, are insecure. It is also shown that t... View full abstract»

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

    Publication Year: 1984, Page(s):637 - 644
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB)

    Two classes of multiple-word correcting convolutional encoders are defined and analyzed. We obtain some conditions for these encoders to be noncatastrophic, and we describe ways to check the (word) minimum distance of the generated codes. The first class can easily be analyzed by algebraic means, but the redundancy of the corresponding codes is not arbitrarily iow. The codes generated by the secon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationship between the Karhunen- Loéve transform and the Courant - Fischer theorem (Corresp.)

    Publication Year: 1984, Page(s):662 - 664
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    It is shown that the Karhunen-Loève transform problem can be formulated as a matrix approximation problem with Hilbert-Schmidt error norm. On the other hand, the Courant-Fischer minimax theorem provides a characterization for the best matrix approximation when the spectral norm is used. It appears that the optimality conditions of the Karhunen-Loève problem lead to the selection of a par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of the white Gaussian multiple access channel with feedback

    Publication Year: 1984, Page(s):623 - 629
    Cited by:  Papers (171)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    Since the appearance of [10] by Gaarder and Wolf, it has been well known that feedback can enlarge the capacity region of the multiple access channel. In this paper a deterministic feedback code is presented for the two-user Gaussian multiple access channel, which is shown to allow reliable communication at all points inside a region larger than any previously obtained. An outer bound is given whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-synchronizing Huffman codes (Corresp.)

    Publication Year: 1984, Page(s):687 - 693
    Cited by:  Papers (111)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1256 KB)

    A problem associated with the use of variable-length source codes is that loss of synchronization may lead to extended errors in the decoded text. In this correspondence it is shown that some binary Huffman codes contain a codeword that resynchronizes the decoder regardless of the synchronization slippage preceding that codeword. Such codes are self-synchronizing in a probabilistic sense, yet requ... 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