000 | 05090nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-319-12325-7 | ||
003 | DE-He213 | ||
005 | 20200421111700.0 | ||
007 | cr nn 008mamaa | ||
008 | 141117s2014 gw | s |||| 0|eng d | ||
020 |
_a9783319123257 _9978-3-319-12325-7 |
||
024 | 7 |
_a10.1007/978-3-319-12325-7 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aMAT008000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aSequences and Their Applications - SETA 2014 _h[electronic resource] : _b8th International Conference, Melbourne, VIC, Australia, November 24-28, 2014, Proceedings / _cedited by Kai-Uwe Schmidt, Arne Winterhof. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014. |
|
300 |
_aXI, 315 p. 25 illus. _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 ; _v8865 |
|
505 | 0 | _aRelationships Between CCZ and EA Equivalence Classes and Corresponding Code Invariants -- Boolean Functions -- Results on Constructions of Rotation Symmetric Bent and Semi-bent Functions -- Properties of a Family of Cryptographic Boolean Functions -- A New Transform Related to Distance from a Boolean Function (Extended Abstract) -- Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice -- Characterizations of Plateaued and Bent Functions in Characteristic -- Perfect Sequences -- A Method of Optimisation of the Exhaustive Computer Search for Perfect Sequences -- Almost Six-Phase Sequences with Perfect Periodic Autocorrelation Function -- A Construction for Perfect Periodic Autocorrelation Sequences -- A Simple Construction of Almost Perfect Quinary ASK and QAM Sequences -- Correlation of Arrays -- Inflation of Perfect Arrays Over the Basic Quaternions of Size mn ¼ �q � 1�=2 -- Families of 3D Arrays for Video Watermarking -- Relative Difference Sets -- The Nonexistence of �18; 3; 18; 6� Relative Difference Sets -- Aperiodic Correlation -- Exhaustive Search for Optimal Minimum Peak Sidelobe Binary Sequences up to Length 80 -- The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers -- Pseudorandom Sequences and Stream Ciphers -- An Equivalence-Preserving Transformation of Shift Registers -- A Lattice Rational Approximation Algorithm for AFSRs Over Quadratic Integer Rings -- On the Lattice Structure of Inversive PRNG via the Additive Order -- Weaknesses in the Initialisation Process of the Common Scrambling Algorithm Stream Cipher -- Distribution Properties of Half-Sequence -- Crosscorrelation of Sequences -- A Note on Cross-Correlation Distribution Between a Ternary m-Sequence and Its Decimated Sequence -- Prime Numbers in Sequences -- Conjectures Involving Sequences and Prime Numbers -- OFDM and CDMA -- Optimal Sign Patterns for a Generalized Schmidl-Cox Method -- A Novel Construction of Asymmetric Sequence Pairs Set with Zero-Correlation Zone -- Frequency-Hopping Sequences On Low-Hit-Zone Frequency-Hopping Sequence Sets with Optimal Partial Hamming Correlation -- Improved Singleton Bound on Frequency Hopping Sequences. | |
520 | _aThis book constitutes the refereed proceedings of the 8th International Conference on Sequences and Their Applications, SETA 2014, held in Melbourne, VIC, Australia, in November 2014. The 24 full papers presented together with 2 invited papers were carefully reviewed and selected from 36 submissions. The papers have been organized in topical sections on Boolean functions, perfect sequences, correlation of arrays, relative difference sets, aperiodic correlation, pseudorandom sequences and stream ciphers, crosscorrelation of sequences, prime numbers in sequences, OFDM and CDMA, and frequency-hopping sequences. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer communication systems. | |
650 | 0 | _aData encryption (Computer science). | |
650 | 0 | _aCoding theory. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aManagement information systems. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aData Encryption. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aManagement of Computing and Information Systems. |
650 | 2 | 4 | _aCoding and Information Theory. |
700 | 1 |
_aSchmidt, Kai-Uwe. _eeditor. |
|
700 | 1 |
_aWinterhof, Arne. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783319123240 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v8865 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-12325-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c54928 _d54928 |