Skip to content

International Conference on Sequences and their Applications

SETA

C

CORE rank

CORE rank (raw)

C

Fields of research

Cybersecurity and Privacy · Theory of Computation

Papers indexed

252

1998–2014

Papers per year

199837 peak2014

SETA papers

252 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2008On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations.Claude Carlet
2008New Perfect Nonlinear Multinomials over Ffor Any Odd Prime p.Lilya Budaghyan, Tor Helleseth
2008The Combinatorics of Differentiation.Anna S. Bertiger, Robert J. McEliece, Sarah L. Sweatlock
2008A New Tool for Assurance of Perfect Nonlinearity.Nuray At, Stephen D. Cohen
2006The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function.Wenying Zhang, Chuan-Kun Wu
2006Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation.Nam Yul Yu, Guang Gong
2006On the Distinctness of Decimations of GeneralizedHong Xu, Wen-Feng Qi
2006Nonexistence of a Kind of Generalized Perfect Binary Array.Xiyong Zhang, Hua Guo, Wenbao Han
2006Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis.Quanlong Wang, Kunpeng Wang, Zongduo Dai
2006Analysis of Designing Interleaved ZCZ Sequence Families.Jin-Song Wang, Wen-Feng Qi
2006The Hausdorff Dimension of the Set ofMichael Vielhaber, Mnica del Pilar Canales Chacon
2006On FCSR Memory Sequences.Tian Tian, Wen-Feng Qi
2006On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.Igor E. Shparlinski, Arne Winterhof
2006On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes.George Petrides, Johannes Mykkeltveit
2006Codes for Optical CDMA.Reza Omrani, P. Vijay Kumar
2006The Probabilistic Theory of the Joint Linear Complexity of Multisequences.Harald Niederreiter
2006Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity.Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
2006Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression.Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis
2006Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants.Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis
2006Linear Complexity overYoung-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
2006Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance.Yutaka Jitsumatsu, Tohru Kohda
2006Improved Rijndael-Like S-Box and Its Transform Domain Analysis.Seok-Yong Jin, Jong-Min Baek, Hong-Yeop Song
2006Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions.Lei Hu, Xiangyong Zeng
2006On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences.Honggang Hu, Lei Hu, Dengguo Feng
2006Extended Hadamard Equivalence.Doreen Hertel
126150 of 252← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.