The SCEAS System
Navigation Menu

Conferences in DBLP

Sequences and Their Applications (seta)
2006 (conf/seta/2006)

  1. Solomon W. Golomb
    Shift Register Sequences - A Retrospective Account. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:1-4 [Conf]
  2. Harald Niederreiter
    The Probabilistic Theory of the Joint Linear Complexity of Multisequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:5-16 [Conf]
  3. Zongduo Dai
    Multi-Continued Fraction Algorithms and Their Applications to Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:17-33 [Conf]
  4. Reza Omrani, P. Vijay Kumar
    Codes for Optical CDMA. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:34-46 [Conf]
  5. Nina Brandstätter, Wilfried Meidl
    On the Linear Complexity of Sidel'nikov Sequences over Fd. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:47-60 [Conf]
  6. Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
    Linear Complexity over Fp of Ternary Sidel'nikov Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:61-73 [Conf]
  7. Jin-Ho Chung, Kyeongcheol Yang
    Bounds on the Linear Complexity and the 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:74-87 [Conf]
  8. Fang-Wei Fu, Harald Niederreiter, Ming Su
    The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:88-103 [Conf]
  9. Nam Yul Yu, Guang Gong
    Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:104-118 [Conf]
  10. Doreen Hertel
    Extended Hadamard Equivalence. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:119-128 [Conf]
  11. Jin-Song Wang, Wen-Feng Qi
    Analysis of Designing Interleaved ZCZ Sequence Families. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:129-140 [Conf]
  12. Tor Helleseth, Cees J. A. Jansen, Shahram Khazaei, Alexander Kholosha
    Security of Jump Controlled Sequence Generators for Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:141-152 [Conf]
  13. Seok-Yong Jin, Jong-Min Baek, Hong-Yeop Song
    Improved Rijndael-Like S-Box and Its Transform Domain Analysis. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:153-167 [Conf]
  14. Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis
    Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:168-179 [Conf]
  15. Ali Doganaksoy, Faruk Göloglu
    On Lempel-Ziv Complexity of Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:180-189 [Conf]
  16. Lihua Dong, Yupu Hu, Yong Zeng
    Computing the k-Error N-Adic Complexity of a Sequence of Period pn. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:190-198 [Conf]
  17. Honggang Hu, Lei Hu, Dengguo Feng
    On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:199-208 [Conf]
  18. George Petrides, Johannes Mykkeltveit
    On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:209-222 [Conf]
  19. Rainer Göttfert
    Sequences of Period 2N-2. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:223-236 [Conf]
  20. Kenneth J. Giuliani, Guang Gong
    A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:237-247 [Conf]
  21. Quanlong Wang, Kunpeng Wang, Zongduo Dai
    Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:248-258 [Conf]
  22. Michael Vielhaber, Mónica del Pilar Canales Chacon
    The Hausdorff Dimension of the Set of r-Perfect M-Multisequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:259-270 [Conf]
  23. Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis
    Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:271-284 [Conf]
  24. Zhixiong Chen, Shengqiang Li, Guozhen Xiao
    Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:285-294 [Conf]
  25. Igor Shparlinski, Arne Winterhof
    On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:295-303 [Conf]
  26. Zhang Xiyong, Guo Hua, Han Wenbao
    Nonexistence of a Kind of Generalized Perfect Binary Array. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:304-312 [Conf]
  27. Hong Xu, Wen-Feng Qi
    On the Distinctness of Decimations of Generalized l-Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:313-322 [Conf]
  28. Tian Tian, Wen-Feng Qi
    On FCSR Memory Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:323-333 [Conf]
  29. Mark Goresky, Andrew Klapper
    Periodicity and Distribution Properties of Combined FCSR Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:334-341 [Conf]
  30. Lifang Feng, Pingzhi Fan
    Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:342-350 [Conf]
  31. Yutaka Jitsumatsu, Tohru Kohda
    Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:351-363 [Conf]
  32. Claude Carlet, Philippe Guillot, Sihem Mesnager
    On Immunity Profile of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:364-375 [Conf]
  33. Deepak Kumar Dalai, Subhamoy Maitra
    Reducing the Number of Homogeneous Linear Equations in Finding Annihilators. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:376-390 [Conf]
  34. Wenying Zhang, Chuan-Kun Wu
    The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:391-401 [Conf]
  35. Lei Hu, Xiangyong Zeng
    Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:402-416 [Conf]
  36. Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase
    Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. [Citation Graph (0, 0)][DBLP]
    SETA, 2006, pp:417-431 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002