On pseudorandom sequences and their application

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

A large family of finite pseudorandom binary sequences is presented, and also tested "theoretically" for pseudorandomness. The optimal way of implementation is discussed and running time analysis is given. Numerical calculations are also presented.

Original languageEnglish
Title of host publicationGeneral Theory of Information Transfer and Combinatorics
EditorsRudolf Ahlswede, Lars Baumer, Ning Cai, Harout Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian, Vladimir Blinovsky
Pages343-361
Number of pages19
DOIs
Publication statusPublished - Dec 1 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4123 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On pseudorandom sequences and their application'. Together they form a unique fingerprint.

  • Cite this

    Rivat, J., & Sárkozy, A. (2006). On pseudorandom sequences and their application. In R. Ahlswede, L. Baumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, H. Mashurian, & V. Blinovsky (Eds.), General Theory of Information Transfer and Combinatorics (pp. 343-361). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4123 LNCS). https://doi.org/10.1007/11889342_19