Cantitate/Preț
Produs
Total produse
Vezi coșul
Sequences and Their Applications - SETA 2014 de Kai-Uwe Schmidt

Sequences and Their Applications - SETA 2014: Lecture Notes in Computer Science, cartea 8865

Editat de Kai-Uwe Schmidt, Arne Winterhof
en Limba Engleză Paperback – dec 2014
This 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32360 lei

Preț vechi: 40450 lei
-20%

Puncte Express: 485

Carte tipărită la comandă

Livrare economică 24 iulie-07 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319123240
ISBN-10: 3319123246
Pagini: 328
Ilustrații: XI, 315 p. 25 illus.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:2014
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Relationships 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 SequencePairs 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.