Eintrag weiter verarbeiten
Online-Ressource

Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings

Gespeichert in:

Personen und Körperschaften: Carlet, Claude (VerfasserIn), Pott, Alexander (Sonstige)
Titel: Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings/ edited by Claude Carlet, Alexander Pott
Format: E-Book Konferenzbericht
Sprache: Englisch
veröffentlicht:
Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 6338
Schlagwörter:
Computer Communication Networks
Computer software
Computational complexity
Information Systems
Computer Science
Computer science
Data encryption (Computer science)
Coding theory
Cryptography.
Discrete mathematics.
Computer networks .
Electronic data processing
Algorithms.
Information theory.
Konferenzschrift > 2010 > Paris
Buchausg. u.d.T.: Sequences and their applications -- SETA 2010, Berlin : Springer, 2010, X, 463S.
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 07444cam a22010932 4500
001 0-1650226195
003 DE-627
005 20240122105252.0
007 cr uuu---uuuuu
008 101005s2010 gw |||||o 00| ||eng c
020 |a 9783642158742  |9 978-3-642-15874-2 
024 7 |a 10.1007/978-3-642-15874-2  |2 doi 
035 |a (DE-627)1650226195 
035 |a (DE-576)330929976 
035 |a (DE-599)BSZ330929976 
035 |a (OCoLC)682059492 
035 |a (OCoLC)731498626 
035 |a (ZBM)1194.94017 
035 |a (DE-He213)978-3-642-15874-2 
035 |a (EBP)040526771 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
050 0 |a QA76.9.M35 
072 7 |a MAT008000  |2 bisacsh 
072 7 |a PBD  |2 bicssc 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
084 |a SS 4800  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *94-06  |2 msc 
084 |a 94A55  |2 msc 
084 |a 00B25  |2 msc 
084 |a 31.49  |2 bkl 
084 |a 54.10  |2 bkl 
084 |a 31.12  |2 bkl 
100 1 |a Carlet, Claude  |4 aut 
245 1 0 |a Sequences and Their Applications – SETA 2010  |b 6th International Conference, Paris, France, September 13-17, 2010. Proceedings  |c edited by Claude Carlet, Alexander Pott 
264 1 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2010 
300 |a Online-Ressource (X, 465p. 50 illus, digital) 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science  |v 6338 
490 0 |a SpringerLink  |a Bücher 
520 |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 Communication Networks 
650 0 |a Computer software 
650 0 |a Computational complexity 
650 0 |a Information Systems 
650 0 |a Computer Science 
650 0 |a Computer science 
650 0 |a Data encryption (Computer science) 
650 0 |a Coding theory 
650 0 |a Cryptography. 
650 0 |a Discrete mathematics. 
650 0 |a Computer networks . 
650 0 |a Electronic data processing 
650 0 |a Algorithms. 
650 0 |a Information theory. 
655 7 |a Konferenzschrift  |y 2010  |z Paris  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
689 0 0 |D s  |0 (DE-588)4017790-7  |0 (DE-627)106328727  |0 (DE-576)208921117  |a Folge  |g Mathematik  |2 gnd 
689 0 |5 DE-101 
700 1 |a Pott, Alexander  |4 oth 
776 1 |z 9783642158735 
776 0 8 |i Buchausg. u.d.T.  |t Sequences and their applications -- SETA 2010  |d Berlin : Springer, 2010  |h X, 463S.  |w (DE-627)1605400181  |w (DE-576)330660993  |z 9783642158735  |z 3642158730 
830 0 |a Lecture notes in computer science  |v 6338  |9 6338  |w (DE-627)316228877  |w (DE-576)093890923  |w (DE-600)2018930-8  |x 1611-3349  |7 ns 
856 4 0 |u https://doi.org/10.1007/978-3-642-15874-2  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz330929976cov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20150929173811  |3 Cover 
856 4 2 |u https://zbmath.org/?q=an:1194.94017  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC  |b 2010 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SCS  |b 2010 
912 |a ZDB-2-SXCS  |b 2010 
912 |a ZDB-2-SEB  |b 2010 
936 r v |a SS 4800  |b Lecture notes in computer science  |k Informatik  |k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen  |k Schriftenreihen (indiv. Sign.)  |k Lecture notes in computer science  |0 (DE-627)1271461242  |0 (DE-625)rvk/143528:  |0 (DE-576)201461242 
936 b k |a 31.49  |j Analysis: Sonstiges  |q SEPA  |0 (DE-627)10641898X 
936 b k |a 54.10  |j Theoretische Informatik  |q SEPA  |0 (DE-627)106418815 
936 b k |a 31.12  |j Kombinatorik  |j Graphentheorie  |q SEPA  |0 (DE-627)106418963 
951 |a BO 
950 |a Zahlenfolge 
950 |a Folge reeller oder komplexer Zahlen 
950 |a Unendliche Zahlenfolge 
950 |a Reihe 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15874-2  |9 DE-14 
852 |a DE-14  |z 2011-07-20T14:58:20Z  |x epn:3336196914 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15874-2  |9 DE-15 
852 |a DE-15  |z 2011-05-16T16:34:18Z  |x epn:3336196965 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15874-2  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |z 2011-01-26T14:27:58Z  |x epn:3336197066 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-15874-2  |9 DE-520 
852 |a DE-520  |z 2010-10-05T14:43:04Z  |x epn:3336197104 
980 |a 1650226195  |b 0  |k 1650226195  |o 330929976 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Sequences+and+Their+Applications+%E2%80%93+SETA+2010%3A+6th+International+Conference%2C+Paris%2C+France%2C+September+13-17%2C+2010.+Proceedings&rft.date=2010&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Sequences+and+Their+Applications+%E2%80%93+SETA+2010%3A+6th+International+Conference%2C+Paris%2C+France%2C+September+13-17%2C+2010.+Proceedings&rft.series=Lecture+notes+in+computer+science%2C+6338&rft.au=Carlet%2C+Claude&rft.pub=Springer+Berlin+Heidelberg&rft.edition=&rft.isbn=3642158749
SOLR
_version_ 1789365703327875072
access_facet Electronic Resources
author Carlet, Claude
author2 Pott, Alexander
author2_role oth
author2_variant a p ap
author_facet Carlet, Claude, Pott, Alexander
author_role aut
author_sort Carlet, Claude
author_variant c c cc
callnumber-first Q - Science
callnumber-label QA76
callnumber-raw QA76.9.M35
callnumber-search QA76.9.M35
callnumber-sort QA 276.9 M35
callnumber-subject QA - Mathematics
collection ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
contents 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.
ctrlnum (DE-627)1650226195, (DE-576)330929976, (DE-599)BSZ330929976, (OCoLC)682059492, (OCoLC)731498626, (ZBM)1194.94017, (DE-He213)978-3-642-15874-2, (EBP)040526771
de15_date 2011-05-16T16:34:18Z
doi_str_mv 10.1007/978-3-642-15874-2
era_facet 2010
facet_912a ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
facet_local_del330 Folge
finc_class_facet Informatik, Mathematik
finc_id_str 0001402076
fincclass_txtF_mv science-computerscience, science-mathematics
format eBook, ConferenceProceedings
format_access_txtF_mv Book, E-Book
format_de105 Ebook
format_de14 Book, E-Book
format_de15 Book, E-Book
format_del152 Buch
format_detail_txtF_mv text-online-monograph-independent-conference
format_dezi4 e-Book
format_finc Book, E-Book
format_legacy ElectronicBook
format_legacy_nrw Book, E-Book
format_nrw Book, E-Book
format_strict_txtF_mv E-Book
genre Konferenzschrift 2010 Paris (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content
genre_facet Konferenzschrift
geogr_code not assigned
geogr_code_person not assigned
geographic_facet Paris
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 6338
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1650226195
illustrated Not Illustrated
imprint Berlin, Heidelberg, Springer Berlin Heidelberg, 2010
imprint_str_mv Berlin, Heidelberg: Springer Berlin Heidelberg, 2010
institution DE-14, DE-Zi4, DE-520, DE-15
is_hierarchy_id 0-1650226195
is_hierarchy_title Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings
isbn 9783642158742
isbn_isn_mv 9783642158735, 3642158730
issn_isn_mv 1611-3349
kxp_id_str 1650226195
language English
last_indexed 2024-01-28T20:01:52.327Z
local_heading_facet_dezwi2 Computer Communication Networks, Computer software, Computational complexity, Information Systems, Computer Science, Computer science, Data encryption (Computer science), Coding theory, Cryptography., Discrete mathematics., Computer networks ., Electronic data processing, Algorithms., Information theory., Folge
marc024a_ct_mv 10.1007/978-3-642-15874-2
match_str carlet2010sequencesandtheirapplicationsseta20106thinternationalconferenceparisfranceseptember13172010proceedings
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)6338
oclc_num 682059492, 731498626
physical Online-Ressource (X, 465p. 50 illus, digital)
publishDate 2010
publishDateSort 2010
publishPlace Berlin, Heidelberg
publisher Springer Berlin Heidelberg
record_format marcfinc
record_id 330929976
recordtype marcfinc
rsn_id_str_mv (DE-15)2462056
rvk_facet SS 4800
rvk_label Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science
rvk_path SS, SQ - SU, SS 4000 - SS 5999, SS 4800
rvk_path_str_mv SS, SQ - SU, SS 4000 - SS 5999, SS 4800
series Lecture notes in computer science, 6338
series2 Lecture Notes in Computer Science ; 6338, SpringerLink ; Bücher
source_id 0
spelling Carlet, Claude aut, Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings edited by Claude Carlet, Alexander Pott, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (X, 465p. 50 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6338, SpringerLink Bücher, 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., Computer Communication Networks, Computer software, Computational complexity, Information Systems, Computer Science, Computer science, Data encryption (Computer science), Coding theory, Cryptography., Discrete mathematics., Computer networks ., Electronic data processing, Algorithms., Information theory., Konferenzschrift 2010 Paris (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4017790-7 (DE-627)106328727 (DE-576)208921117 Folge Mathematik gnd, DE-101, Pott, Alexander oth, 9783642158735, Buchausg. u.d.T. Sequences and their applications -- SETA 2010 Berlin : Springer, 2010 X, 463S. (DE-627)1605400181 (DE-576)330660993 9783642158735 3642158730, Lecture notes in computer science 6338 6338 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-15874-2 X:SPRINGER Verlag lizenzpflichtig Volltext, https://swbplus.bsz-bw.de/bsz330929976cov.jpg V:DE-576 X:springer image/jpeg 20150929173811 Cover, https://zbmath.org/?q=an:1194.94017 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-15874-2 DE-14, DE-14 2011-07-20T14:58:20Z epn:3336196914, http://dx.doi.org/10.1007/978-3-642-15874-2 DE-15, DE-15 2011-05-16T16:34:18Z epn:3336196965, http://dx.doi.org/10.1007/978-3-642-15874-2 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:27:58Z epn:3336197066, http://dx.doi.org/10.1007/978-3-642-15874-2 DE-520, DE-520 2010-10-05T14:43:04Z epn:3336197104
spellingShingle Carlet, Claude, Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings, Lecture notes in computer science, 6338, 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., Computer Communication Networks, Computer software, Computational complexity, Information Systems, Computer Science, Computer science, Data encryption (Computer science), Coding theory, Cryptography., Discrete mathematics., Computer networks ., Electronic data processing, Algorithms., Information theory., Konferenzschrift 2010 Paris, Folge Mathematik
swb_id_str 330929976
title Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings
title_auth Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings
title_full Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings edited by Claude Carlet, Alexander Pott
title_fullStr Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings edited by Claude Carlet, Alexander Pott
title_full_unstemmed Sequences and Their Applications – SETA 2010 6th International Conference, Paris, France, September 13-17, 2010. Proceedings edited by Claude Carlet, Alexander Pott
title_in_hierarchy 6338. Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings (2010)
title_short Sequences and Their Applications – SETA 2010
title_sort sequences and their applications seta 2010 6th international conference paris france september 13 17 2010 proceedings
title_sub 6th International Conference, Paris, France, September 13-17, 2010. Proceedings
title_unstemmed Sequences and Their Applications – SETA 2010: 6th International Conference, Paris, France, September 13-17, 2010. Proceedings
topic Computer Communication Networks, Computer software, Computational complexity, Information Systems, Computer Science, Computer science, Data encryption (Computer science), Coding theory, Cryptography., Discrete mathematics., Computer networks ., Electronic data processing, Algorithms., Information theory., Konferenzschrift 2010 Paris, Folge Mathematik
topic_facet Computer Communication Networks, Computer software, Computational complexity, Information Systems, Computer Science, Computer science, Data encryption (Computer science), Coding theory, Cryptography., Discrete mathematics., Computer networks ., Electronic data processing, Algorithms., Information theory., Konferenzschrift, Folge
url https://doi.org/10.1007/978-3-642-15874-2, https://swbplus.bsz-bw.de/bsz330929976cov.jpg, https://zbmath.org/?q=an:1194.94017, http://dx.doi.org/10.1007/978-3-642-15874-2