000			05199nam a22006015i 4500
001			978-3-642-15874-2
003			DE-He213
005			20140220084547.0
007			cr nn 008mamaa
008			100906s2010 gw | s |||| 0|eng d
020			_a9783642158742 _9978-3-642-15874-2
024	7		_a10.1007/978-3-642-15874-2 _2doi
050		4	_aQA76.9.M35
072		7	_aPBD _2bicssc
072		7	_aUYAM _2bicssc
072		7	_aCOM018000 _2bisacsh
072		7	_aMAT008000 _2bisacsh
082	0	4	_a004.0151 _223
100	1		_aCarlet, Claude. _eeditor.
245	1	0	_aSequences and Their Applications – SETA 2010 _h[electronic resource] : _b6th International Conference, Paris, France, September 13-17, 2010. Proceedings / _cedited by Claude Carlet, Alexander Pott.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aX, 465p. 50 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aLecture Notes in Computer Science, _x0302-9743 ; _v6338
505	0		_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 Constructed Quaternary 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.
520			_aThis book constitutes the proceedings of the 6th International Conference on Sequences and Their Applications held in Paris, France, in September 2010.
650		0	_aComputer science.
650		0	_aComputer Communication Networks.
650		0	_aData encryption (Computer science).
650		0	_aCoding theory.
650		0	_aComputer software.
650		0	_aComputational complexity.
650		0	_aInformation Systems.
650	1	4	_aComputer Science.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aData Encryption.
650	2	4	_aComputer Communication Networks.
650	2	4	_aManagement of Computing and Information Systems.
650	2	4	_aCoding and Information Theory.
700	1		_aPott, Alexander. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642158735
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6338
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-15874-2
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c112732 _d112732