LEADER 07614nam 22009255 450 001 9910483503103321 005 20251113192557.0 010 $a1-280-38916-8 010 $a9786613567086 010 $a3-642-15874-9 024 7 $a10.1007/978-3-642-15874-2 035 $a(CKB)2670000000045117 035 $a(SSID)ssj0000446774 035 $a(PQKBManifestationID)11318381 035 $a(PQKBTitleCode)TC0000446774 035 $a(PQKBWorkID)10498051 035 $a(PQKB)11589884 035 $a(DE-He213)978-3-642-15874-2 035 $a(MiAaPQ)EBC3065786 035 $a(PPN)149024843 035 $a(BIP)32170345 035 $a(EXLCZ)992670000000045117 100 $a20100906d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSequences and Their Applications - SETA 2010 $e6th International Conference, Paris, France, September 13-17, 2010. Proceedings /$fedited by Claude Carlet, Alexander Pott 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (X, 465 p. 50 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6338 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-15873-0 320 $aIncludes bibliographical references and index. 327 $aInvited Paper -- Low Correlation Zone Sequences -- Algorithmic Aspects -- Decimation Generator of Zadoff-Chu Sequences -- An Algorithm for Constructing a Fastest Galois NLFSR Generating a Given Sequence -- Acquisition Times of Contiguous and Distributed Marker Sequences: A Cross-Bifix Analysis -- Frequency Hopping -- Lower Bounds on the Average Partial Hamming Correlations of Frequency Hopping Sequences with Low Hit Zone -- New Families of Frequency-Hopping Sequences of Length mN Derived from the k-Fold Cyclotomy -- Multiple Access Systems -- User-Irrepressible Sequences -- New Optimal Variable-Weight Optical Orthogonal Codes -- Invited Paper -- Recent Results on Recursive Nonlinear Pseudorandom Number Generators -- Linear Complexity -- A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets -- On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences -- An Improved Approximation Algorithm for Computing the k-Error Linear Complexity of Sequences Using the Discrete Fourier Transform -- Finite Fields -- Transformations on Irreducible Binary Polynomials -- Power Permutations in Dimension 32 -- Character Sums -- Multiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators -- Ternary Kloosterman Sums Modulo 18 Using Stickelberger?s Theorem -- Merit Factor -- Appended m-Sequences with Merit Factor Greater than 3.34 -- FCSR -- A With-Carry Walsh Transform -- Clock-Controlled FCSR Sequence with Large Linear Complexity -- Vectorial Conception of FCSR -- Hadamard Matrices and Transforms -- Fourier Duals of Björck Sequences -- New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences -- Cryptography -- ?4-Nonlinearity of a ConstructedQuaternary Cryptographic Functions Class -- A Public Key Cryptosystem Based upon Euclidean Addition Chains -- Optimal Authentication Codes from Difference Balanced Functions -- Invited Paper -- New Extensions and Applications of Welch-Bound-Equality Sequence Sets -- Statistical Analysis -- Evaluation of Randomness Test Results for Short Sequences -- Statistical Analysis of Search for Set of Sequences in Random and Framed Data -- Boolean Functions and Related Problems -- On the Nonlinearity of Discrete Logarithm in -- On a Conjecture about Binary Strings Distribution -- Nega?Hadamard Transform, Bent and Negabent Functions -- Synchronization of Boolean Dynamical Systems: A Spectral Characterization -- Nonbinary Sequences -- Some Constructions of Almost-Perfect, Odd-Perfect and Perfect Polyphase and Almost-Polyphase Sequences -- Almost p-Ary Perfect Sequences -- Sequences, Bent Functions and Jacobsthal Sums -- Infinite Sequences -- Infinite Sequences with Finite Cross-Correlation -- Invited Paper -- Reed Muller Sensing Matrices and the LASSO. 330 $aThis volumecontainstherefereedproceedingsoftheSixth International Conf- ence on Sequences and Their Applications (SETA 2010), held in Paris, France, September 13-17, 2010. The previous ?ve conferences were held in Singapore (RepublicofSingapore),Bergen(Norway),Seoul(SouthKorea),Beijing(China) and Lexington (USA). Topics of SETA include: - Randomness of sequences - Correlation (periodic and aperiodic types) and combinatorial aspects of - quences (di'erence sets) - Sequences with applications in coding theory and cryptography - Sequences over ?nite ?elds/rings/function ?elds - Linear and nonlinear feedback shift register sequences - Sequences for radar distance ranging, synchronization, identi'cation, and hardware testing - Sequences for wireless communication - Pseudorandom sequence generators - Boolean and vectorial functions for sequences, coding and/or cryptography - Multidimensional sequences and their correlation properties - Linear and nonlinear complexity of sequences The Technical Program Committee of SETA 2010 refereed 56 submitted - pers. Each paper was reviewed by at least 2 referees (at least 3 when an author was a TPC member) and the TPC selected 33 papers to be presented at the conference. In addition, we had 4 invited papers, byRobert Calderbank(Prin- ton University, USA), James Massey (retired from ETH Zurich, Switzerland), Jong-Seon No (Seoul National University, South Korea) and Arne Winterhof ¨ (Osterreichische Akademie der Wissenschaften, Austria). TheCo-chairsoftheTPCwereClaudeCarlet(Universit´ eParis8,France)and Alexander Pott (Otto-von-Guericke-Universit¨ at, Magdeburg, Germany). They wish to thank the other members of the ProgramCommittee: Thierry P. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6338 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aCryptography 606 $aData encryption (Computer science) 606 $aComputer networks 606 $aElectronic data processing$xManagement 606 $aCoding theory 606 $aInformation theory 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aCryptology 606 $aComputer Communication Networks 606 $aIT Operations 606 $aCoding and Information Theory 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aCryptography. 615 0$aData encryption (Computer science). 615 0$aComputer networks. 615 0$aElectronic data processing$xManagement. 615 0$aCoding theory. 615 0$aInformation theory. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aCryptology. 615 24$aComputer Communication Networks. 615 24$aIT Operations. 615 24$aCoding and Information Theory. 676 $a515.24 701 $aCarlet$b Claude$01726352 701 $aPott$b Alexander$060997 712 12$aSETA 2010 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483503103321 996 $aSequences and their applications-- SETA 2010$94191390 997 $aUNINA