SETA 2006: Beijing, China

Invited Papers

• Solomon W. Golomb:
  Shift Register Sequences - A Retrospective Account. 1-4
  
• Harald Niederreiter:
  The Probabilistic Theory of the Joint Linear Complexity of Multisequences. 5-16
  
• Zongduo Dai:
  Multi-Continued Fraction Algorithms and Their Applications to Sequences. 17-33
  
• Reza Omrani, P. Vijay Kumar:
  Codes for Optical CDMA. 34-46
  

Linear Complexity of Sequences

• Nina Brandstätter, Wilfried Meidl:
  On the Linear Complexity of Sidel'nikov Sequences over F_d. 47-60
  
• Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung:
  Linear Complexity over F_p of Ternary Sidel'nikov Sequences. 61-73
  
• Jin-Ho Chung, Kyeongcheol Yang:
  Bounds on the Linear Complexity and the 1-Error Linear Complexity over F_p of M-ary Sidel'nikov Sequences. 74-87
  
• Fang-Wei Fu, Harald Niederreiter, Ming Su:
  The Characterization of 2ⁿ-Periodic Binary Sequences with Fixed 1-Error Linear Complexity. 88-103
  

Correlation of Sequences

• Nam Yul Yu, Guang Gong:
  Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation. 104-118
  
• Doreen Hertel:
  Extended Hadamard Equivalence. 119-128
  
• Jin-Song Wang, Wen-Feng Qi:
  Analysis of Designing Interleaved ZCZ Sequence Families. 129-140
  

Stream Ciphers and Transforms

• Tor Helleseth, Cees J. A. Jansen, Shahram Khazaei, Alexander Kholosha:
  Security of Jump Controlled Sequence Generators for Stream Ciphers. 141-152
  
• Seok-Yong Jin, Jong-Min Baek, Hong-Yeop Song:
  Improved Rijndael-Like S-Box and Its Transform Domain Analysis. 153-167
  

Topics in Complexities of Sequences

• Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis:
  Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression. 168-179
  
• Ali Doganaksoy, Faruk Göloglu:
  On Lempel-Ziv Complexity of Sequences. 180-189
  
• Lihua Dong, Yupu Hu, Yong Zeng:
  Computing the k-Error N-Adic Complexity of a Sequence of Period pⁿ. 190-198
  
• Honggang Hu, Lei Hu, Dengguo Feng:
  On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences. 199-208
  

Linear/Nonlinear Feedback Shift Register Sequences

• George Petrides, Johannes Mykkeltveit:
  On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes. 209-222
  
• Rainer Göttfert:
  Sequences of Period 2^N-2. 223-236
  
• Kenneth J. Giuliani, Guang Gong:
  A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences. 237-247
  

Multi-sequence Synthesis

• Quanlong Wang, Kunpeng Wang, Zongduo Dai:
  Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis. 248-258
  
• Michael Vielhaber, Mónica del Pilar Canales Chacon:
  The Hausdorff Dimension of the Set of r-Perfect M-Multisequences. 259-270
  

Filtering Sequences and Pseudorandom Sequence Generators

• Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis:
  Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants. 271-284
  
• Zhixiong Chen, Shengqiang Li, Guozhen Xiao:
  Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm. 285-294
  
• Igor Shparlinski, Arne Winterhof:
  On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences. 295-303
  

Sequences and Combinatorics

• Zhang Xiyong, Guo Hua, Han Wenbao:
  Nonexistence of a Kind of Generalized Perfect Binary Array. 304-312
  

FCSR Sequences

• Hong Xu, Wen-Feng Qi:
  On the Distinctness of Decimations of Generalized l-Sequences. 313-322
  
• Tian Tian, Wen-Feng Qi:
  On FCSR Memory Sequences. 323-333
  
• Mark Goresky, Andrew Klapper:
  Periodicity and Distribution Properties of Combined FCSR Sequences. 334-341
  

Aperiodic Correlation and Applications

• Lifang Feng, Pingzhi Fan:
  Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences. 342-350
  
• Yutaka Jitsumatsu, Tohru Kohda:
  Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance. 351-363
  

Boolean Functions

• Claude Carlet, Philippe Guillot, Sihem Mesnager:
  On Immunity Profile of Boolean Functions. 364-375
  
• Deepak Kumar Dalai, Subhamoy Maitra:
  Reducing the Number of Homogeneous Linear Equations in Finding Annihilators. 376-390
  
• Wenying Zhang, Chuan-Kun Wu:
  The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function. 391-401
  
• Lei Hu, Xiangyong Zeng:
  Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions. 402-416
  
• Soumen Maity, Chrisil Arackaparambil, Kezhasono Meyase:
  Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. 417-431
  

Last update Fri May 25 08:36:50 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page