Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3486)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: SETA 2004.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
Keywords
- Boolean function
- algorithms
- binary sequences
- coding theory
- communication engineering
- complexity
- discrete Fourier transform
- information theory
- multisequences
- perfect sequences
- pseudo-random sequences
- random numbers
- sequence complexity
- sequences
- stream ciphers
- algorithm analysis and problem complexity
Table of contents (34 papers)
-
Complexity of Sequences I
-
Complexity of Sequences II
-
Sequence Constructions
Other volumes
-
Sequences and Their Applications - SETA 2004
Editors and Affiliations
Bibliographic Information
Book Title: Sequences and Their Applications - SETA 2004
Book Subtitle: Third International Conference, Seoul, Korea, October 24-28, 2004, Revised Selected Papers
Editors: Tor Helleseth, Dilip Sarwate, Hong-Yeop Song, Kyeongcheol Yang
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b136167
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2005
Softcover ISBN: 978-3-540-26084-4Published: 01 June 2005
eBook ISBN: 978-3-540-32048-7Published: 20 May 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 451
Topics: Coding and Information Theory, Cryptology, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Numeric Computing, Symbolic and Algebraic Manipulation