Sequences and Their Applications - SETA 2004 Third International Conference, Seoul, Korea, October 24-28, 2004. Revised Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Helleseth, Tor (Επιμελητής έκδοσης), Sarwate, Dilip (Επιμελητής έκδοσης), Song, Hong-Yeop (Επιμελητής έκδοσης), Yang, Kyeongcheol (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3486
• Θέματα: Computer science.; Data encryption (Computer science).; Coding theory.; Computers.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Computer Science.; Coding and Information Theory.; Data Encryption.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Symbolic and Algebraic Manipulation.

This volume contains the refereed proceedings of the 3rd International Conf- ence on Sequences and Their Applications (SETA 2004), held in Seoul, Korea during October 24–28, 2004. The previous two conferences, SETA 1998 and SETA 2001, were held in Singapore and Bergen, Norway, respectively. These co...

Πίνακας περιεχομένων:

• 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-Based Cryptosystems 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.