|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-15874-2 |
| 003 |
DE-He213 |
| 005 |
20230222095732.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100906s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642158742
|9 978-3-642-15874-2
|
| 024 |
7 |
|
|a 10.1007/978-3-642-15874-2
|2 doi
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 050 |
|
4 |
|a QA297.4
|
| 072 |
|
7 |
|a UYAM
|2 bicssc
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a UYAM
|2 thema
|
| 072 |
|
7 |
|a PBD
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Sequences and Their Applications - SETA 2010
|h [electronic resource] :
|b 6th International Conference, Paris, France, September 13-17, 2010. Proceedings /
|c edited by Claude Carlet, Alexander Pott.
|
| 250 |
|
|
|a 1st ed. 2010.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2010.
|
| 300 |
|
|
|a X, 465 p. 50 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6338
|
| 505 |
0 |
|
|a Invited 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.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Cryptography.
|
| 650 |
|
0 |
|a Data encryption (Computer science).
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Electronic data processing-Management.
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Information theory.
|
| 650 |
1 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Cryptology.
|
| 650 |
2 |
4 |
|a Computer Communication Networks.
|
| 650 |
2 |
4 |
|a IT Operations.
|
| 650 |
2 |
4 |
|a Coding and Information Theory.
|
| 700 |
1 |
|
|a Carlet, Claude.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Pott, Alexander.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642158735
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642158759
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 6338
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-15874-2
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
