We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Computer science

Search Results

Showing 401-410 of 410 results

  1. Perfect Local Randomness in Pseudo-random Sequences

    The concept of provable cryptographic security for pseudo-random number generators that was introduced by Schnorr is investigated and extended. The...
    Ueli M. Maurer, James L. Massey in Advances in Cryptology — CRYPTO’ 89 Proceedings
    Conference paper 1990

  2. On the Existence of Pseudorandom Generators

    Pseudorandom generators (suggested and developed by Blum and Micali and Yao) are efficient deterministic programs that expand a randomly selected k...
    Oded Goldreich, Hugo Krawczyk, Michael Luby in Advances in Cryptology — CRYPTO’ 88
    Conference paper 1990

  3. Families of codes exceeding the Varshamov-Gilbert bound

    The number A(q) is the superior limit of the maximum number of points of an algebraic curve defined over the finite field with q elements, divided by...
    Marc Perret in Coding Theory and Applications
    Conference paper 1989

  4. A conjecture on the free distance of (2,1,m) binary convolutional codes

    It is shown that the fixed binary (2,1,m) convolutional codes satisfy the Costello bound if two conjectures on the weight distribution of binary...
    Ph. Piret in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
    Conference paper 1989

  5. Generating codewords in real space: Application to decoding

    We consider maximum-likelihood decoding (MLD) of binary linear codes from the viewpoint of space complexity. We discuss the concept of projecting...
    G. D. Cohen, P. J. Godlewski, T. Y. Hwang in Coding Theory and Applications
    Conference paper 1989

  6. The generalized Goppa codes and related discrete designs from hermitian surfaces in PG(3, s2)

    A short description is first given of the fascinating use of Hermitian curves and normal rational curves by Goppa in the construction of linear error...
    I. M. Chakravarti in Coding Theory and Applications
    Conference paper 1988

  9. Goppa codes: Algorithmic problems

    Martin Becker, Günter Schellenberger in EUROCAL '85
    Conference paper 1985

  10. Introduction

    (1.1.1) Definition An (n,M,d) code is a set of M binary vectors of length n, called codewords, such that any two codewords differ in at least d...
    N. J. A. Sloane in A Short Course on Error Correcting Codes
    Chapter 1975
Did you find what you were looking for? Share feedback.