Del i serien Lecture Notes in Computer Science

Sequences and Their Applications – SETA 2006

4th International Conference, Beijing, China, September 24-28, 2006, Proceedings

Häftad, Engelska, 2006

AvGuang Gong,Tor Helleseth,Hong-Yeop Song,Kyeongcheol Yang

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 4th International Conference on Sequences and Their Applications, SETA 2006. The book presents 32 revised full papers together with 4 invited lectures. The papers are organized in topical sections on linear complexity of sequences, correlation of sequences, stream ciphers and transforms, topics in complexities of sequences, multi-sequence synthesis, sequences and combinatorics, FCSR sequences, aperiodic correlation and applications, and boolean functions, and more.

Produktinformation

Utgivningsdatum2006-09-13
Mått155 x 235 x 25 mm
Vikt680 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor436
Upplaga2006
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540445234

Tillhör följande kategorier

Beräkning och matematisk analys inom Naturvetenskap och teknik

Invited Papers.- Shift Register Sequences – A Retrospective Account.- The Probabilistic Theory of the Joint Linear Complexity of Multisequences.- Multi-Continued Fraction Algorithms and Their Applications to Sequences.- Codes for Optical CDMA.- Linear Complexity of Sequences.- On the Linear Complexity of Sidel’nikov Sequences over .- Linear Complexity over F p of Ternary Sidel’nikov Sequences.- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences.- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity.- Correlation of Sequences.- Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation.- Extended Hadamard Equivalence.- Analysis of Designing Interleaved ZCZ Sequence Families.- Stream Ciphers and Transforms.- Security of Jump Controlled Sequence Generators for Stream Ciphers.- Improved Rijndael-Like S-Box and Its Transform Domain Analysis.- Topics in Complexities of Sequences.- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression.- On Lempel-Ziv Complexity of Sequences.- Computing the k-Error N-Adic Complexity of a Sequence of Period p n .- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences.- Linear/Nonlinear Feedback Shift Register Sequences.- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes.- Sequences of Period 2 N –2.- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences.- Multi-sequence Synthesis.- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis.- The Hausdorff Dimension of the Set of r-Perfect M-Multisequences.- Filtering Sequences andPseudorandom Sequence Generators.- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants.- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm.- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.- Sequences and Combinatorics.- Nonexistence of a Kind of Generalized Perfect Binary Array.- FCSR Sequences.- On the Distinctness of Decimations of Generalized l-Sequences.- On FCSR Memory Sequences.- Periodicity and Distribution Properties of Combined FCSR Sequences.- Aperiodic Correlation and Applications.- Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences.- Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance.- Boolean Functions.- On Immunity Profile of Boolean Functions.- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators.- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function.- Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions.- Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity.

Du kanske också är intresserad av

Sequences and Their Applications - SETA 2004

Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yang

Häftad, 2005

749 kr

Sequences, Subsequences, and Consequences

Solomon W. Golomb, Guang Gong, Tor Helleseth, Hong-Yeop Song

Häftad, 2007

749 kr

Del 726

Mathematical Properties of Sequences and Other Combinatorial Structures

Jong-Seon No, Hong-Yeop Song, Tor Helleseth, P. Vijay Kumar

Häftad, 2012

1 439 kr

Del 726

Mathematical Properties of Sequences and Other Combinatorial Structures

Jong-Seon No, Hong-Yeop Song, Tor Helleseth, P. Vijay Kumar

Inbunden, 2003

1 439 kr

Del 12056

Foundations and Practice of Security

Abdelmalek Benzekri, Michel Barbeau, Guang Gong, Romain Laborde, Joaquin Garcia-Alfaro

Häftad, 2020

749 kr

WISDOM OF SOLOMON, THE: THE GENIUS AND LEGACY OF SOLOMON GOLOMB

Golomb Beatrice a, Beatrice A Golomb, Guang Gong, Alfred W Hales

Inbunden, 2023

2 999 kr

Communication System Security

Lidong Chen, Guang Gong

Inbunden, 2012

3 919 kr

Signal Design for Good Correlation

Solomon W. Golomb, Guang Gong

Inbunden, 2005

2 449 kr

Progress in Cryptology - INDOCRYPT 2010

Guang Gong, Kishan Chand Gupta

Häftad, 2010

749 kr

Selected Areas in Cryptography

Alex Biryukov, Guang Gong, Douglas R. Stinson

Häftad, 2011

749 kr

Del i serien Lecture Notes in Computer Science

Sequences and Their Applications – SETA 2006

4th International Conference, Beijing, China, September 24-28, 2006, Proceedings

Häftad, Engelska, 2006

AvGuang Gong,Tor Helleseth,Hong-Yeop Song,Kyeongcheol Yang

729 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum2006-09-13
Mått155 x 235 x 25 mm
Vikt680 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor436
Upplaga2006
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540445234

Tillhör följande kategorier

Beräkning och matematisk analys inom Naturvetenskap och teknik

Invited Papers.- Shift Register Sequences – A Retrospective Account.- The Probabilistic Theory of the Joint Linear Complexity of Multisequences.- Multi-Continued Fraction Algorithms and Their Applications to Sequences.- Codes for Optical CDMA.- Linear Complexity of Sequences.- On the Linear Complexity of Sidel’nikov Sequences over .- Linear Complexity over F p of Ternary Sidel’nikov Sequences.- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences.- The Characterization of 2 n -Periodic Binary Sequences with Fixed 1-Error Linear Complexity.- Correlation of Sequences.- Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation.- Extended Hadamard Equivalence.- Analysis of Designing Interleaved ZCZ Sequence Families.- Stream Ciphers and Transforms.- Security of Jump Controlled Sequence Generators for Stream Ciphers.- Improved Rijndael-Like S-Box and Its Transform Domain Analysis.- Topics in Complexities of Sequences.- Nonlinear Complexity of Binary Sequences and Connections with Lempel-Ziv Compression.- On Lempel-Ziv Complexity of Sequences.- Computing the k-Error N-Adic Complexity of a Sequence of Period p n .- On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences.- Linear/Nonlinear Feedback Shift Register Sequences.- On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes.- Sequences of Period 2 N –2.- A New Algorithm to Compute Remote Terms in Special Types of Characteristic Sequences.- Multi-sequence Synthesis.- Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear Synthesis.- The Hausdorff Dimension of the Set of r-Perfect M-Multisequences.- Filtering Sequences andPseudorandom Sequence Generators.- Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants.- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm.- On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.- Sequences and Combinatorics.- Nonexistence of a Kind of Generalized Perfect Binary Array.- FCSR Sequences.- On the Distinctness of Decimations of Generalized l-Sequences.- On FCSR Memory Sequences.- Periodicity and Distribution Properties of Combined FCSR Sequences.- Aperiodic Correlation and Applications.- Generalized Bounds on Partial Aperiodic Correlation of Complex Roots of Unity Sequences.- Chip-Asynchronous Version of Welch Bound: Gaussian Pulse Improves BER Performance.- Boolean Functions.- On Immunity Profile of Boolean Functions.- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators.- The Algebraic Normal Form, Linear Complexity and k-Error Linear Complexity of Single-Cycle T-Function.- Partially Perfect Nonlinear Functions and a Construction of Cryptographic Boolean Functions.- Construction of 1-Resilient Boolean Functions with Very Good Nonlinearity.