![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 37 matches
- 2008
- Nuray At, Stephen D. Cohen
:
A New Tool for Assurance of Perfect Nonlinearity. SETA 2008: 415-419 - Anna S. Bertiger, Robert J. McEliece, Sarah L. Sweatlock:
The Combinatorics of Differentiation. SETA 2008: 142-152 - Lilya Budaghyan, Tor Helleseth:
New Perfect Nonlinear Multinomials over Ffor Any Odd Prime p. SETA 2008: 403-414 - Claude Carlet:
On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations. SETA 2008: 345-367 - Ayça Çesmelioglu
, Arne Winterhof
:
On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences. SETA 2008: 60-70 - Pascale Charpin, Gohar M. Kyureghyan:
On a Class of Permutation Polynomials over F2m. SETA 2008: 368-376 - Jin-Ho Chung, Kyeongcheol Yang:
Design of M-Ary Low Correlation Zone Sequence Sets by Interleaving. SETA 2008: 313-321 - Michael J. Collins, Scott A. Mitchell:
Distance-Avoiding Sequences for Extremely Low-Bandwidth Authentication. SETA 2008: 230-238 - Deepak Kumar Dalai
:
On 3-to-1 and Power APN S-Boxes. SETA 2008: 377-389 - Gagan Garg, P. Vijay Kumar, C. E. Veni Madhavan:
Two New Families of Low-Correlation Interleaved QAM Sequences. SETA 2008: 130-141 - Faruk Göloglu
, Alexander Pott:
Results on the Crosscorrelation and Autocorrelation of Sequences. SETA 2008: 95-105 - Domingo Gómez
, Arne Winterhof
:
Multiplicative Character Sums of Recurring Sequences with Rédei Functions. SETA 2008: 175-181 - Guang Gong:
Sequences, DFT and Resistance against Fast Algebraic Attacks. SETA 2008: 197-218 - Mark Goresky, Andrew Klapper:
Some Results on the Arithmetic Correlation of Sequences. SETA 2008: 71-80 - Shamgar Gurevich, Ronny Hadani, Nir A. Sochen:
Group Representation Design of Digital Signals and Sequences. SETA 2008: 153-166 - Hiroshi Haramoto
, Makoto Matsumoto, Pierre L'Ecuyer
:
A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space. SETA 2008: 290-298 - Tor Helleseth, Alexander Kholosha:
m-Sequences of Lengths 22k-1 and 2k-1 with at Most Four-Valued Cross Correlation. SETA 2008: 106-120 - Honggang Hu, Guang Gong:
A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order. SETA 2008: 51-59 - Ramakanth Kavuluru
:
2n-Periodic Binary Sequences with Fixed k-Error Linear Complexity for k=2 or 3. SETA 2008: 252-265 - Andrew Klapper:
Expected pi-Adic Security Measures of Sequences. SETA 2008: 219-229 - Pierre L'Ecuyer
:
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation. SETA 2008: 1-17 - Cédric Lauradoux, Andrea Röck:
Parallel Generation of l-Sequences. SETA 2008: 299-312 - Petr Lisonek:
On the Connection between Kloosterman Sums and Elliptic Curves. SETA 2008: 182-187 - Wilfried Meidl, Ferruh Özbudak
:
Generalized Joint Linear Complexity of Linear Recurring Multisequences. SETA 2008: 266-277 - Yuki Ohtsuka, Makoto Matsumoto, Mariko Hagita:
Projective de Bruijn Sequences. SETA 2008: 167-174 - Ki-Hyeon Park, Hong-Yeop Song:
A Probabilistic Approach on Estimating the Number of Modular Sonar Sequences. SETA 2008: 42-50 - Daiyuan Peng, Tu Peng, Xiaohu Tang, Xianhua Niu:
A Class of Optimal Frequency Hopping Sequences Based upon the Theory of Power Residues. SETA 2008: 188-196 - Sondre Rønjom, Håvard Raddum
:
On the Number of Linearly Independent Equations Generated by XL. SETA 2008: 239-251 - Kai-Uwe Schmidt, Matthew Geoffrey Parker, Alexander Pott:
Negabent Functions in the Maiorana-McFarland Class. SETA 2008: 390-402 - Patrick Solé, Dmitrii Zinoviev:
The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings. SETA 2008: 322-331
skipping 7 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-04 10:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint