Sequences and Their Applications - SETA 2004: Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers: Lecture Notes in Computer Science, cartea 3486
Editat de Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yangen Limba Engleză Paperback – iun 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 392.98 lei
Nou
Puncte Express: 589
Preț estimativ în valută:
75.21€ • 78.12$ • 62.47£
75.21€ • 78.12$ • 62.47£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540260844
ISBN-10: 3540260846
Pagini: 468
Ilustrații: XII, 451 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540260846
Pagini: 468
Ilustrații: XII, 451 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- A Survey of Some Recent Results on Bent Functions.- A Survey of the Merit Factor Problem for Binary Sequences.- A Survey of Feedback with Carry Shift Registers.- Univariate and Multivariate Merit Factors.- Complexity of Sequences I.- Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences.- Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences.- Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences.- A Unified View on Sequence Complexity Measures as Isometries.- Complexity of Sequences II.- One-Error Linear Complexity over F p of Sidelnikov Sequences.- On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences.- On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two.- On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences.- Perfect Sequences.- Almost-Perfect and Odd-Perfect Ternary Sequences.- Cross-Correlation Properties of Perfect Binary Sequences.- Sequence Constructions.- New Sets of Binary and Ternary Sequences with Low Correlation.- Improved p-ary Codes and Sequence Families from Galois Rings.- Quadriphase Sequences Obtained from Binary Quadratic Form Sequences.- New Families of p-Ary Sequences from Quadratic Form with Low Correlation and Large Linear Span.- Sequences over ? m .- On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers.- Distribution of r-Patterns in the Most Significant Bit of a Maximum Length Sequence over .- Sequence Generator Properties and Applications.- Algebraic Feedback Shift Registers Based on Function Fields.- New LFSR-BasedCryptosystems and the Trace Discrete Log Problem (Trace-DLP).- Cryptanalysis of a Particular Case of Klimov-Shamir Pseudo-Random Generator.- Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2.- Multi-dimensional Sequences.- Multi-continued Fraction Algorithm and Generalized B-M Algorithm over F 2.- A New Search for Optimal Binary Arrays with Minimum Peak Sidelobe Levels.- New Constructions of Quaternary Hadamard Matrices.- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I,H,N} n Transform.- Optics and OFDM Applications.- New Constructions and Bounds for 2-D Optical Orthogonal Codes.- Topics on Optical Orthogonal Codes.- Weighted Degree Trace Codes for PAPR Reduction.- Polynomials and Functions.- Which Irreducible Polynomials Divide Trinomials over GF(2)?.- Autocorrelation Properties of Resilient Functions and Three-Valued Almost-Optimal Functions Satisfying PC(p).- Group Algebras and Correlation Immune Functions.