Electronic submissions of full papers are due on April 1, 2010. Submitted papers should be of sufficient detail for review by experts in the field and must not substantially duplicate work that any author has published elsewhere or has submitted in parallel to any other journal, conference, or workshop that has proceedings. Accepted submissions may not appear in any other conference or workshop that has proceedings.
Submission Format
- Each submission may be up to 12 pages in length. It must be submitted as a PDF file through the SETA'2010 submission website.
- The final version of the paper must be typeset using LaTeXand the LNCS style.
Best paper award
$500 will be given by SPRINGER and the journal
Cryptography and Communications, Discrete Structures, Boolean
functions and sequences (CCDS). The winning paper will be chosen by
the SETA PC co-chairs on the basis of its evaluation by the PC and its
authors will be invited to publish a longer version in CCDS; special consideration
will be given to papers whose authors list contains at least one student.
Practical information
The conference venue is Telecom ParisTech, the leading French engineering school in Telecommunications, located in treizième arrondissement of Paris, near the artists' quarter called Buttes aux Cailles.
Address : 46, rue Barrault - F-75013 Paris [Getting there]
- Robert Calderbank, Princeton University, USA - James Massey, ETH Zurich, Switzerland (retired) - Jong-Seon No, Seoul National University, Korea - Arne Winterhof, Österreichische Akademie der Wissenschaften (Austrian Academy of Sciences)
- Submission deadline: April 1, 2010
- Notification of acceptance: May 15
- Final paper submission: June 6
Topics
Previously unpublished papers on all technical aspects of sequences and their applications in communications, cryptography, and combinatorics are solicited for submission to SETA 2010. Topics include: • Randomness of sequences • Correlation (periodic and aperiodic types) and combinatorial aspects of sequences (difference sets) • Sequences with applications in coding theory and cryptography • Sequences over finite fields/rings/function fields • Linear and nonlinear feedback shift register sequences • Sequences for radar distance ranging, synchronization, identification, and hardware testing • Sequences for wireless communication • Pseudorandom sequence generators • Boolean and vectorial functions for sequences, coding and/or cryptography • Multidimensional sequences and their correlation properties • Linear and nonlinear complexity of sequences
Technical Program Committee
-Claude Carlet (co-chair), Université de Paris 8, St-Denis, France
- Alexander Pott (co-chair), Otto-von-Guericke-Universität, Magdeburg, Germany
- Thierry P. Berger, Université de Limoges, France
- Serdar Boztaş, Royal Melbourne Institute of Technology, Australia
- Lilya Budaghyan, University of Bergen, Norway
- Pascale Charpin, INRIA, France
- Gérard Cohen, Telecom ParisTech, France
- Cunsheng Ding, Hong Kong University of Science and Technology, PR of China
- Pingzhi Fan, Southwest Jiaotong University Chengdu, PR of China
- Philippe Gaborit, Université de Limoges, France
- Guang Gong, University of Waterloo, Canada
- Tor Helleseth, University of Bergen, Norway
- Jonathan Jedwab, Simon Fraser University, Canada
- Thomas Johansson, Lund University, Sweden
- Andrew Klapper, University of Kentucky, USA
- Gohar Kyureghyan, Otto-von-Guericke-Universität, Germany
- Gregor Leander, Technical University of Denmark
- Wilfried Meidl, Sabanci University, Turkey
- Sihem Mesnager, Université de Paris 8, St-Denis, France
- Gary McGuire, Claude Shannon Institute for Discrete Mathematics,
Coding and Cryptography, Ireland
- Udaya Parampalli, University of Melbourne, Australia
- Matthew Parker, University of Bergen, Norway
- Bernhard Schmidt, Nanyang Technological University, Singapore
- Kai-Uwe Schmidt, Simon Fraser University, Canada
- Hong-Yeop Song, Yonsei University, Korea
- Kyeongcheol Yang, Pohang University of Science and Technology, Korea
- Nam Yul Yu, Lakehead University, Canada
