LEADER 06368nam 22008655 450 001 9910484837203321 005 20251226202708.0 010 $a3-540-44524-2 024 7 $a10.1007/11863854 035 $a(CKB)1000000000284003 035 $a(SSID)ssj0000320012 035 $a(PQKBManifestationID)11274540 035 $a(PQKBTitleCode)TC0000320012 035 $a(PQKBWorkID)10343839 035 $a(PQKB)11648911 035 $a(DE-He213)978-3-540-44524-1 035 $a(MiAaPQ)EBC3068026 035 $a(PPN)123138388 035 $a(BIP)34164315 035 $a(BIP)13627434 035 $a(EXLCZ)991000000000284003 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSequences and Their Applications ? SETA 2006 $e4th International Conference, Beijing, China, September 24-28, 2006, Proceedings /$fedited by Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XII, 436 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4086 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-44523-4 320 $aIncludes bibliographical references and index. 327 $aInvited 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 -- Linear Complexity over F p of Ternary Sidel?nikov Sequences -- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel?nikov Sequences -- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity -- Correlation of Sequences -- Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation -- Extended Hadamard Equivalence -- Analysis of Designing Interleaved ZCZ Sequence Families -- Stream Ciphers and Transforms -- Security of Jump Controlled Sequence Generators for Stream Ciphers -- Improved Rijndael-Like 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 p n -- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences -- Linear/Nonlinear Feedback Shift Register Sequences -- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes -- Sequences of Period 2 N ?2 -- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences -- Multi-sequence Synthesis -- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis -- The Hausdorff Dimension of the Set of r-Perfect M-Multisequences -- Filtering Sequences andPseudorandom Sequence Generators -- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants -- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm -- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences -- Sequences and Combinatorics -- Nonexistence of a Kind of Generalized Perfect Binary Array -- FCSR Sequences -- On the Distinctness of Decimations of Generalized l-Sequences -- On FCSR Memory Sequences -- Periodicity and Distribution Properties of Combined FCSR Sequences -- Aperiodic Correlation and Applications -- Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences -- Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance -- Boolean Functions -- On Immunity Profile of Boolean Functions -- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators -- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function -- Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions -- Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity. 330 $aThis book constitutes the refereed proceedings of the 4th International Conference on Sequences and Their Applications, SETA 2006. The book presents 32 revised full papers together with 4 invited lectures. The papers are organized in topical sections on linear complexity of sequences, correlation of sequences, stream ciphers and transforms, topics in complexities of sequences, multi-sequence synthesis, sequences and combinatorics, FCSR sequences, aperiodic correlation and applications, and boolean functions, and more. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4086 606 $aCoding theory 606 $aInformation theory 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer science 606 $aAlgorithms 606 $aNumerical analysis 606 $aComputer science$xMathematics 606 $aCoding and Information Theory 606 $aCryptology 606 $aTheory of Computation 606 $aAlgorithms 606 $aNumerical Analysis 606 $aSymbolic and Algebraic Manipulation 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aNumerical analysis. 615 0$aComputer science$xMathematics. 615 14$aCoding and Information Theory. 615 24$aCryptology. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aNumerical Analysis. 615 24$aSymbolic and Algebraic Manipulation. 676 $a515/.24 701 $aGong$b Guang$f1956-$01757502 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484837203321 996 $aSequences and their applications-- SETA 2006$94198416 997 $aUNINA