Sequences and Their Applications – SETA 2006: 4th International Conference Beijing, China, September 24-28, 2006 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 4th International Conference on Sequences and Their Applications, SETA 2006, held in Beijing in September 2006.

The 32 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on linear complexity of sequences, correlation of sequences, stream ciphers and transforms, topics in complexities of sequences, linear/nonlinear feedback shift register sequences, multi-sequence synthesis, filtering sequences and pseudorandom sequence generators, sequences and combinatorics, FCSR sequences, aperiodic correlation and applications, and boolean functions.

Author(s): Solomon W. Golomb (auth.), Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang (eds.)
Series: Lecture Notes in Computer Science 4086 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006

Language: English
Pages: 436
Tags: Coding and Information Theory; Data Encryption; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Numeric Computing; Symbolic and Algebraic Manipulation

Front Matter....Pages -
Shift Register Sequences – A Retrospective Account....Pages 1-4
The Probabilistic Theory of the Joint Linear Complexity of Multisequences....Pages 5-16
Multi-Continued Fraction Algorithms and Their Applications to Sequences....Pages 17-33
Codes for Optical CDMA....Pages 34-46
On the Linear Complexity of Sidel’nikov Sequences over ${\mathbb {F}}_d$ ....Pages 47-60
Linear Complexity over F p of Ternary Sidel’nikov Sequences....Pages 61-73
Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M -ary Sidel’nikov Sequences....Pages 74-87
The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity....Pages 88-103
Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation....Pages 104-118
Extended Hadamard Equivalence....Pages 119-128
Analysis of Designing Interleaved ZCZ Sequence Families....Pages 129-140
Security of Jump Controlled Sequence Generators for Stream Ciphers....Pages 141-152
Improved Rijndael-Like S-Box and Its Transform Domain Analysis....Pages 153-167
Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression....Pages 168-179
On Lempel-Ziv Complexity of Sequences....Pages 180-189
Computing the k -Error N -Adic Complexity of a Sequence of Period p n ....Pages 190-198
On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences....Pages 199-208
On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes....Pages 209-222
Sequences of Period 2 N –2....Pages 223-236
A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences....Pages 237-247
Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis....Pages 248-258
The Hausdorff Dimension of the Set of r -Perfect M -Multisequences....Pages 259-270
Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants....Pages 271-284
Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm....Pages 285-294
On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences....Pages 295-303
Nonexistence of a Kind of Generalized Perfect Binary Array....Pages 304-312
On the Distinctness of Decimations of Generalized l -Sequences....Pages 313-322
On FCSR Memory Sequences....Pages 323-333
Periodicity and Distribution Properties of Combined FCSR Sequences....Pages 334-341
Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences....Pages 342-350
Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance....Pages 351-363
On Immunity Profile of Boolean Functions....Pages 364-375
Reducing the Number of Homogeneous Linear Equations in Finding Annihilators....Pages 376-390
The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function....Pages 391-401
Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions....Pages 402-416
Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity....Pages 417-431
Back Matter....Pages -