Skip to main content
  • Conference proceedings
  • © 2006

Sequences and Their Applications – SETA 2006

4th International Conference, Beijing, China, September 24-28, 2006, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4086)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): SETA: International Conference on Sequences and Their Applications

Conference proceedings info: SETA 2006.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (36 papers)

  1. Front Matter

  2. Linear Complexity of Sequences

    1. Linear Complexity over F p of Ternary Sidel’nikov Sequences

      • Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung
      Pages 61-73
  3. Correlation of Sequences

    1. Extended Hadamard Equivalence

      • Doreen Hertel
      Pages 119-128
    2. Analysis of Designing Interleaved ZCZ Sequence Families

      • Jin-Song Wang, Wen-Feng Qi
      Pages 129-140
  4. Stream Ciphers and Transforms

    1. Security of Jump Controlled Sequence Generators for Stream Ciphers

      • Tor Helleseth, Cees J. A. Jansen, Shahram Khazaei, Alexander Kholosha
      Pages 141-152
    2. Improved Rijndael-Like S-Box and Its Transform Domain Analysis

      • Seok-Yong Jin, Jong-Min Baek, Hong-Yeop Song
      Pages 153-167
  5. Topics in Complexities of Sequences

    1. Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression

      • Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis
      Pages 168-179
    2. On Lempel-Ziv Complexity of Sequences

      • Ali Doğanaksoy, Faruk Göloğlu
      Pages 180-189
    3. Computing the k-Error N-Adic Complexity of a Sequence of Period p n

      • Lihua Dong, Yupu Hu, Yong Zeng
      Pages 190-198
  6. Linear/Nonlinear Feedback Shift Register Sequences

    1. Sequences of Period 2 N –2

      • Rainer Göttfert
      Pages 223-236

Other Volumes

  1. Sequences and Their Applications – SETA 2006

Keywords

  • Boolean function
  • algorithms
  • binary sequences
  • calculus
  • coding theory
  • communication engineering
  • complexity
  • differential equation
  • information theory
  • logarithm
  • multisequences
  • pseudo-random sequences
  • random numbers
  • sequences
  • stream ciphers
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada

    Guang Gong

  • Department of Informatics, University of Bergen, Bergen, Norway

    Tor Helleseth

  • Department of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea

    Hong-Yeop Song

  • Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), Pohang, Korea

    Kyeongcheol Yang

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions