序列及应用2006LNCS-4086: Sequences and their applications - SETA 2006
点此进入淘宝搜索页搜索分类: 图书,自然科学,数学,数学分析,
作者： Guang Gong，Tor Helleseth ，Hong-Yeop Song，Kyeongcheol Yang 著
出 版 社： 湖南文艺出版社
出版时间： 2006-12-1字数：版次： 1页数： 431印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540445234包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.)
内容简介
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.
目录
Invited Papers
Shift Register Sequences-A Retrospective Account
The Probabilistic Theory of the Joint Linear Complexity of Multisequences
Multi-Continued Fraction Algorithms and Their Applications to Sequences
Codes for Optical CDMA
Linear Complexity of Sequences
On the Linear Complexity of Sidel'nikov Sequences over Fd
Linear Complexity over Fd of Ternary Sidel'nikov Sequences
Bounds on the Linear Complexity and the 1-Error Linear Complexity over Fp of M-ary Sidel'nikov Sequences
The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity
Correlation of Sequences
Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrilation
Extended Hadamard Equivalencd
Analysis of Designing Interleaved ZCZ Sequence Families
Stream Ciphers and Transforms
Security of Jump Controlled Sequence Generators for Stream Ciphers
Improved Rijndael-Liks S-Box and Its Transform Domain Analysis
Topics in Complexities of Sequences
Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression
On Lempel-Ziv Complexity of Sequences
Computing the k-Error N-Adic Complexity of a Sequence of Period pn
On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Mutisequences
Linear/Nonlinear Feedback Shift Register Sequences
On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes
Sequences of Period 2N-2
A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences
Multi-sequence Synthesis
Filtering Sequences and Pseudorandom Sequence Generators
Sequences and Combinatorics
Aperiodic Correlation and Applicatons
Boolean Functions
Author Index
