IEEE Transactions on Information Theory

Issue 1 • Jan. 1990

Filter Results

Displaying Results 1 - 25 of 33
  • A fair protocol for signing contracts

    Publication Year: 1990, Page(s):40 - 46
    Cited by:  Papers (81)  |  Patents (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (832 KB)

    Two parties, A and B, want to sign a contract C over a communication network. To do so, they must simultaneously exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in piece-by-piece manner. During such a protocol, one party or another may have a slight advantage; a fair p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trellis-coded multidimensional phase modulation

    Publication Year: 1990, Page(s):63 - 89
    Cited by:  Papers (180)  |  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2164 KB)

    A 2L-dimensional multiple phase-shift keyed (L*MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L*MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A limit law on the distance distribution of binary codes

    Publication Year: 1990, Page(s):229 - 232
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (272 KB)

    An approximation is given of the distance distribution of a binary code by the binomial distribution with an exponentially decreasing error term. Specifically, the upper bound of the relative error term between the normalized distance distribution of a binary code and the binomial distribution has been asymptotically improved. In particular, the bound becomes exponentially small for large distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal authentication systems and combinatorial designs

    Publication Year: 1990, Page(s):54 - 62
    Cited by:  Papers (2)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (568 KB)

    In 1982, G.J. Simmons introduced a mathematical model of authentication theory. Recently, E.F. Brickell (1984) and D.R. Stinson (1988) have shown some combinatorial constructions for optimal authentication systems. In the present work, game-theoretical models are proposed for authentication systems that have multilevel costs on sources, and lower bounds of the game values are obtained. Some constr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new time domain, multistage permutation algorithm [switching systems]

    Publication Year: 1990, Page(s):171 - 173
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (288 KB)

    It is shown that a frame of N time slots can be arbitrarily permuted with 2log2N-1 controlled exchange switches with associated delay elements. This is an improvement over previously known interconnection networks that require O( N) exchange elements. The proof utilizes the recursive algorithm of V.E. Benes (1965) and the time interchange properties o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a class of primitive BCH-codes

    Publication Year: 1990, Page(s):222 - 228
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    The author introduces a special class of primitive BCH codes, the minimal BCH (MB) codes. It is proved that an MB code has as minimum distance its designed distance. Using the Roos bound, the author proposes a lower bound, sometimes tight, for the minimum distance of the dual of an MB code. He describes the subclass of weakly self-dual extended MB codes and then characterizes some weakly self-dual... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the achievable rate region of sequential decoding for a class of multiaccess channels

    Publication Year: 1990, Page(s):180 - 183
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (372 KB)

    The achievable-rate region of sequential decoding for the class of pairwise reversible multiaccess channels is determined. This result is obtained by finding tight lower bounds to the average list size for the same class of channels. The average list size is defined as the expected number of incorrect messages that appear, to a maximum-likelihood decoder, to be at least as likely as the correct me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds and constructions of disjoint sets of distinct difference sets

    Publication Year: 1990, Page(s):184 - 190
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (508 KB)

    An (I,J)-DDD is a set of I disjoint sets of distinct difference sets each having J elements. A number of constructions are given. Upper and lower bounds on the maximal element in a DDD (disjoint distinct difference) set are given. It is shown that regular DDD sets exist for I≳4J View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast signature scheme based on congruential polynomial operations

    Publication Year: 1990, Page(s):47 - 53
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (568 KB)

    A novel digital signature scheme is proposed in which the computation time is much shorter than that of the Rivest-Shamir-Adelman (RSA) scheme, while the key length and signature length are comparable to those for the RSA scheme. Moreover, the proposed scheme can be implemented easily and is, therefore, more practical for many digital signature applications. The scheme is based on congruential pol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extremal properties of rate distortion functions

    Publication Year: 1990, Page(s):166 - 171
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (388 KB)

    An attempt is made to determine whether it is true that for a fixed distortion level Δ the rate-distortion function R( P,Δ) has in the distribution P no local maxima with values different from the global maximum. It is shown that, in general, the answer is negative. However, the answer is positive for Hamming distortion measures. Moreover their R is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptographic systems using redundancy

    Publication Year: 1990, Page(s):31 - 39
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (468 KB)

    The problem of ensuring recoverability of encrypting data in a file storage system is examined. In this situation, the original data (plaintext) are removed from the system after encryption. In the event of errors either in the initial processing or in the storage of the data, the file may be rendered unrecoverable. A model of a file storage system that incorporates errors in these areas is develo... View full abstract»

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

    Publication Year: 1990, Page(s):153 - 156
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (328 KB)

    The capacity of uniform hypergraphs can be defined as a natural generalization of the Shannon capacity of graphs. Corresponding to every uniform hypergraph there is a discrete memoryless channel in which the zero error capacity, in the case of the smallest list size for which it is positive, equals the capacity of the hypergraph, and vice versa. Also, the problem of perfect hashing can be consider... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic decoding beyond eBCH of some binary cyclic codes, when e>eBCH

    Publication Year: 1990, Page(s):214 - 222
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (656 KB)

    For a number of binary cyclic codes with e>e BCH, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' wit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the dimension of subfield subcodes

    Publication Year: 1990, Page(s):90 - 93
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (284 KB)

    A new lower bound for the dimension of a subfield subcode is given. This bound improves the well-known lower bound of P. Delsarte (1975) and coincides in many cases with the true dimension of the code. Alternant codes and geometric Goppa codes are discussed as special cases View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The exact information complexity of Indian poker

    Publication Year: 1990, Page(s):232 - 234
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (188 KB)

    Suppose N people are in a circle and each has a K-bit integer on his forehead and can see the others' integers but does not know his own. The problem is to determine how many bits of information must be exchanged among the players so that each can determine his own number after the exchange. The authors provide an algorithm for which the number of bits that suffices equals K<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Average and randomized communication complexity

    Publication Year: 1990, Page(s):3 - 16
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1036 KB)

    The communication complexity of a two-variable function f(x,y) is the number of information bits two communicators need to exchange to compute f when, initially, each knows only one of the variables. There are several communication-complexity measures corresponding to whether (1) the worst case or average number of bits is considered, (2) computation errors are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and zero-error capacity of Ising channels

    Publication Year: 1990, Page(s):173 - 180
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (524 KB)

    Simple binary symmetric one- and two-dimensional channel systems called Ising channels are investigated. The one-dimensional version is a certain binary finite-state channel with input intersymbol interference. Its zero-error capacity is determined together with lower and upper bounds to its Shannon capacity. For the two-dimensional channel system, a lower bound is obtained for the zero-error capa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some new optimum Golomb rulers

    Publication Year: 1990, Page(s):183 - 184
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (188 KB)

    By exhaustive computer search, the minimum length Golomb rulers (or B2-sequences or difference triangles) containing 14, 15, and 16 marks are found. They are unique and of length 127, 151, and 177, respectively View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal linear equivalent analysis of a variable-memory binary sequence generator

    Publication Year: 1990, Page(s):190 - 192
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    Starting from a memory-based nonlinear generator due to P.R. Geffe (1973), a binary sequence generator (MEM-BSG), consisting of three linear feedback shift registers and a variable memory, is defined and analyzed. The MEM-BSG is shown to be convenient for generating fast binary sequences of large period and linear complexity, which may be useful in spread-spectrum and cryptographic applications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on the capacity of Gaussian channels with feedback

    Publication Year: 1990, Page(s):156 - 161
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (336 KB)

    The capacity of the discrete-time additive Gaussian channel without feedback is known. A class of upper bounds on the capacity with noiseless feedback that are quite good for some exemplary channels is obtained View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulated annealing in compound Gaussian random fields [image processing]

    Publication Year: 1990, Page(s):94 - 107
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (832 KB)

    Recently, a stochastic relaxation technique called simulated annealing has been developed to search for a globally optimal solution in image estimation and restoration problems. The convergence of simulated annealing has been proved only for random fields with a compact range space. Because of this, images were modeled as random fields with bounded discrete or continuous values. However, in most i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a new binary [22,13,5] code

    Publication Year: 1990, Page(s):228 - 229
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (164 KB)

    A new binary [22,13,5] quasi-perfect code is presented. The weight distributions of the coset codes are given. The code obtained is not equivalent to T.J. Wagner's code (1966). Four lower bounds for constant weight codes can be derived from it, which are better than the codes with the same parameters in R.L. Graham and N.J. Sloane (1980) and A.E. Brouwer et al. (1980) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random coding for additive Gaussian channels with feedback

    Publication Year: 1990, Page(s):17 - 22
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (284 KB)

    A random coding strategy for discrete-time additive Gaussian noise channels with feedback is analyzed. It has long been known that feedback may increase the capacity of such channels as long as the additive noise process is not white. Here, it is proved that a strictly positive gain is always achieved and that, as the signal power goes to zero, the ratio of feedback capacity to capacity without fe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sign-sign LMS convergence with independent stochastic inputs

    Publication Year: 1990, Page(s):197 - 201
    Cited by:  Papers (26)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (380 KB)

    The sign-sign adaptive least-mean-square (LMS) identifier filter is a computationally efficient variant of the LMS identifier filter. It involves the introduction of signum functions in the traditional LMS update term. Consideration is given to global convergence of parameter estimates offered by this algorithm, to a ball with radius proportional to the algorithm step size for white input sequence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An implementation of Elias coding for input-restricted channels

    Publication Year: 1990, Page(s):162 - 165
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (392 KB)

    An implementation of Elias coding for input-restricted channels is presented and analyzed. This is a variable-to-fixed length coding method that uses finite-precision arithmetic and can work at rates arbitrarily close to channel capacity as the precision is increased. The method offers a favorable tradeoff between complexity and coding efficiency. For example, in experiments with the runlength con... 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