•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Sequences With High Nonlinear Complexity

Author:
Niederreiter, Harald
,
Chaoping Xing
Publisher:
IEEE
Year
: 2014
DOI: 10.1109/TIT.2014.2343225
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/1141161
Keyword(s): cryptography,probability,random sequences,Hermitian function fields,explicit inversive sequences,finite fields,maximum order complexity,nonlinear complexity,pseudorandom sequences,Complexity theory,Cryptography,Educational institutions,Generators,Polynomials,Probabilistic logic,Random sequences,Linear complexity,maximum-order complexity,nonlinear complexity,pseudorandom sequence
Collections :
  • Latin Articles
  • Show Full MetaData Hide Full MetaData
  • Statistics

    Sequences With High Nonlinear Complexity

Show full item record

contributor authorNiederreiter, Harald
contributor authorChaoping Xing
date accessioned2020-03-13T00:17:15Z
date available2020-03-13T00:17:15Z
date issued2014
identifier issn0018-9448
identifier other6872578.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1141161
formatgeneral
languageEnglish
publisherIEEE
titleSequences With High Nonlinear Complexity
typeJournal Paper
contenttypeMetadata Only
identifier padid8323590
subject keywordscryptography
subject keywordsprobability
subject keywordsrandom sequences
subject keywordsHermitian function fields
subject keywordsexplicit inversive sequences
subject keywordsfinite fields
subject keywordsmaximum order complexity
subject keywordsnonlinear complexity
subject keywordspseudorandom sequences
subject keywordsComplexity theory
subject keywordsCryptography
subject keywordsEducational institutions
subject keywordsGenerators
subject keywordsPolynomials
subject keywordsProbabilistic logic
subject keywordsRandom sequences
subject keywordsLinear complexity
subject keywordsmaximum-order complexity
subject keywordsnonlinear complexity
subject keywordspseudorandom sequence
identifier doi10.1109/TIT.2014.2343225
journal titleInformation Theory, IEEE Transactions on
journal volume60
journal issue10
filesize184229
citations0
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace