# Sequences and their applications--SETA 2004 : third international conference, Seoul, Korea, October 24-28, 2004 : revised selected papers / Tor Helleseth [and others] (eds.).

##### By: SETA 2004 (2004 : Seoul, Korea)

##### Contributor(s): Helleseth, Tor

Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 3486.Publisher: Berlin ; New York : Springer, ©2005Description: 1 online resource (xii, 450 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540320487; 3540320482; 3540260846; 9783540260844Other title: SETA 2004Subject(s): Sequences (Mathematics) -- Congresses | Suites (Mathématiques) -- Congrès | Codage -- Congrès | MATHEMATICS -- Infinity | Sequences (Mathematics) | Informatique | Sequences (Mathematics)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Sequences and their applications--SETA 2004.DDC classification: 515/.24 LOC classification: QA292 | .S48 2004ebOther classification: O17-532 Online resources: Click here to access onlineItem type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook | Available |

"This volume contains the refereed proceedings of the 3rd International Conference on Sequences and Their Applications (SETA 2004), held in Seoul, Korea during October 24-28, 2004."

Includes bibliographical references and index.

Print version record.

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.

There are no comments for this item.