000 05217nam a22006015i 4500
001 978-3-540-44524-1
003 DE-He213
005 20160624101949.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540445241
_9978-3-540-44524-1
024 7 _a10.1007/11863854
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM031000
_2bisacsh
082 0 4 _a003.54
_223
245 1 0 _aSequences and Their Applications – SETA 2006
_h[electronic resource] :
_b4th International Conference Beijing, China, September 24-28, 2006 Proceedings /
_cedited by Guang Gong, Tor Helleseth, Hong-Yeop Song, Kyeongcheol Yang.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
300 _aXII, 436 p.
_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 ;
_v4086
505 0 _aInvited 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 and Pseudorandom 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.
650 0 _aComputer science.
650 0 _aData encryption (Computer science).
650 0 _aCoding theory.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aAlgebra
_xData processing.
650 1 4 _aComputer Science.
650 2 4 _aCoding and Information Theory.
650 2 4 _aData Encryption.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aNumeric Computing.
650 2 4 _aSymbolic and Algebraic Manipulation.
700 1 _aGong, Guang.
_eeditor.
700 1 _aHelleseth, Tor.
_eeditor.
700 1 _aSong, Hong-Yeop.
_eeditor.
700 1 _aYang, Kyeongcheol.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540445234
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4086
856 4 0 _uhttp://dx.doi.org/10.1007/11863854
942 _2EBK4876
_cEBK
999 _c34170
_d34170