Sequences and Their Applications - SETA 2008 [[electronic resource] ] : 5th International Conference Lexington, KY, USA, September 14-18, 2008, Proceedings / / edited by Solomon W. Golomb, Matthew G. Parker, Alexander Pott, Arne Winterhof |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XII, 421 p.) |
Disciplina | 515.24 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer science Mathematical models Algebra Coding theory Information theory Discrete Mathematics in Computer Science Theory of Computation Mathematical Modeling and Industrial Mathematics Symbolic and Algebraic Manipulation Coding and Information Theory |
ISBN | 3-540-85912-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Probabilistic Methods and Randomness Properties of Sequences -- Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation -- On Independence and Sensitivity of Statistical Randomness Tests -- New Distinguishers Based on Random Mappings against Stream Ciphers -- A Probabilistic Approach on Estimating the Number of Modular Sonar Sequences -- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order -- On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences -- Correlation -- Some Results on the Arithmetic Correlation of Sequences -- A Class of Nonbinary Codes and Sequence Families -- Results on the Crosscorrelation and Autocorrelation of Sequences -- m-Sequences of Lengths 22k ??1 and 2 k ???1 with at Most Four-Valued Cross Correlation -- On the Correlation Distribution of Kerdock Sequences -- Two New Families of Low-Correlation Interleaved QAM Sequences -- Combinatorial and Algebraic Foundations -- The Combinatorics of Differentiation -- Group Representation Design of Digital Signals and Sequences -- Projective de Bruijn Sequences -- Multiplicative Character Sums of Recurring Sequences with Rédei Functions -- On the Connection between Kloosterman Sums and Elliptic Curves -- A Class of Optimal Frequency Hopping Sequences Based upon the Theory of Power Residues -- Security Aspects of Sequences -- Sequences, DFT and Resistance against Fast Algebraic Attacks -- Expected ?-Adic Security Measures of Sequences -- Distance-Avoiding Sequences for Extremely Low-Bandwidth Authentication -- On the Number of Linearly Independent Equations Generated by XL -- 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k?=?2 or 3 -- Generalized Joint Linear Complexity of Linear Recurring Multisequences -- Algorithms -- A Lattice-Based Minimal Partial Realization Algorithm -- A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space -- Parallel Generation of ?-Sequences -- Correlation of Sequences over Rings -- Design of M-Ary Low Correlation Zone Sequence Sets by Interleaving -- The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings -- On Partial Correlations of Various Z 4 Sequence Families -- Nonlinear Functions over Finite Fields -- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations -- On a Class of Permutation Polynomials over -- On 3-to-1 and Power APN S-Boxes -- Negabent Functions in the Maiorana–McFarland Class -- New Perfect Nonlinear Multinomials over F for Any Odd Prime p -- A New Tool for Assurance of Perfect Nonlinearity. |
Record Nr. | UNISA-996465303803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Sequences and Their Applications - SETA 2008 : 5th International Conference Lexington, KY, USA, September 14-18, 2008, Proceedings / / edited by Solomon W. Golomb, Matthew G. Parker, Alexander Pott, Arne Winterhof |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XII, 421 p.) |
Disciplina | 515.24 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Computer science Mathematical models Algebra Coding theory Information theory Discrete Mathematics in Computer Science Theory of Computation Mathematical Modeling and Industrial Mathematics Symbolic and Algebraic Manipulation Coding and Information Theory |
ISBN | 3-540-85912-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Probabilistic Methods and Randomness Properties of Sequences -- Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation -- On Independence and Sensitivity of Statistical Randomness Tests -- New Distinguishers Based on Random Mappings against Stream Ciphers -- A Probabilistic Approach on Estimating the Number of Modular Sonar Sequences -- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order -- On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences -- Correlation -- Some Results on the Arithmetic Correlation of Sequences -- A Class of Nonbinary Codes and Sequence Families -- Results on the Crosscorrelation and Autocorrelation of Sequences -- m-Sequences of Lengths 22k ??1 and 2 k ???1 with at Most Four-Valued Cross Correlation -- On the Correlation Distribution of Kerdock Sequences -- Two New Families of Low-Correlation Interleaved QAM Sequences -- Combinatorial and Algebraic Foundations -- The Combinatorics of Differentiation -- Group Representation Design of Digital Signals and Sequences -- Projective de Bruijn Sequences -- Multiplicative Character Sums of Recurring Sequences with Rédei Functions -- On the Connection between Kloosterman Sums and Elliptic Curves -- A Class of Optimal Frequency Hopping Sequences Based upon the Theory of Power Residues -- Security Aspects of Sequences -- Sequences, DFT and Resistance against Fast Algebraic Attacks -- Expected ?-Adic Security Measures of Sequences -- Distance-Avoiding Sequences for Extremely Low-Bandwidth Authentication -- On the Number of Linearly Independent Equations Generated by XL -- 2 n -Periodic Binary Sequences with Fixed k-Error Linear Complexity for k?=?2 or 3 -- Generalized Joint Linear Complexity of Linear Recurring Multisequences -- Algorithms -- A Lattice-Based Minimal Partial Realization Algorithm -- A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space -- Parallel Generation of ?-Sequences -- Correlation of Sequences over Rings -- Design of M-Ary Low Correlation Zone Sequence Sets by Interleaving -- The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings -- On Partial Correlations of Various Z 4 Sequence Families -- Nonlinear Functions over Finite Fields -- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations -- On a Class of Permutation Polynomials over -- On 3-to-1 and Power APN S-Boxes -- Negabent Functions in the Maiorana–McFarland Class -- New Perfect Nonlinear Multinomials over F for Any Odd Prime p -- A New Tool for Assurance of Perfect Nonlinearity. |
Record Nr. | UNINA-9910768441803321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Sequences and Their Applications - SETA 2010 [[electronic resource] ] : 6th International Conference, Paris, France, September 13-17, 2010. Proceedings / / edited by Claude Carlet, Alexander Pott |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (X, 465 p. 50 illus.) |
Disciplina | 515.24 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Cryptography Data encryption (Computer science) Computer networks Electronic data processing—Management Coding theory Information theory Discrete Mathematics in Computer Science Cryptology Computer Communication Networks IT Operations Coding and Information Theory |
ISBN |
1-280-38916-8
9786613567086 3-642-15874-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996465894003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Sequences and their applications-- SETA 2010 : 6th International Conference, Paris, France, September 13-17, 2010 : proceedings / / Claude Carlet, Alexander Pott (eds.) |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | New York, : Springer, 2010 |
Descrizione fisica | 1 online resource (X, 465 p. 50 illus.) |
Disciplina | 515.24 |
Altri autori (Persone) |
CarletClaude
PottAlexander |
Collana | Lecture notes in computer science |
Soggetto topico |
Sequences (Mathematics)
Coding theory |
ISBN |
1-280-38916-8
9786613567086 3-642-15874-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNINA-9910483503103321 |
New York, : Springer, 2010 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|