SEquences and Their Applications (SETA) 2014 (November 24 to 28, 2014)

 

Social Program and Excursion details are updated!

NEW: Social Program with a map of the venue

Building 168 (Doug McDonnel) is at J20 on this map

NEW: List of Participants

Sponsors and Registration links are updated!

Key dates

  • Submission of paper: 11 May 2014

    Extended until 25 May 2014

  • Notification of authors: 15 June 2014

  • Final version: 06 July 2014

NEW: POSTER UPDATED

SETA is the leading international conference in  the areas of sequences and their  applications to communication and cryptography. It has been held in various locations around the world in  Singapore (Republic of Singapore) 1998, Bergen (Norway) 2001, Seoul (South Korea) 2004, Beijing (China) 2006, Lexington (USA) 2008, Paris (France) 2010 and Waterloo (Canada) 2012. The conference provides a forum for the research communities of these domains, and covers all of the fundamental, computational and implementation aspects of these fields. The SETA proceedings will be published by Springer.

 

The eighth International Conference on Sequences and Their Applications (SETA’14) will be held from November 24 to 28, 2014, in Melbourne, Australia. Previously unpublished papers on all technical aspects of sequences and their applications in communications, cryptography, and combinatorics are solicited for submission to SETA’14. 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
  • Correlation and transformation of Boolean functions
  • Multidimensional sequences and their correlation properties
  • Linear and nonlinear complexity of sequences

General Chair

  • Udaya Parampalli, University of Melbourne, Australia

Program Co-Chairs

  • Arne Winterhof, Austrian Academy of Sciences, Austria
  • Kai-Uwe Schmidt, Otto-von-Guericke University, Germany

Program Committee

Local Organization Committee

  • Udaya Parampalli, University of Melbourne, Australia
  • Sanming Zhou, Department of Mathematics and Statistics, The University of Melbourne, Australia
  • Leonie Simpson, Queensland University of Technology, Australia

Instructions for Authors

  • Electronic submissions of full papers are due on 11, May 2014. 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

  • Full papers of up to 12 pages can be submitted in PDF format via

    SETA 2014 EasyChair link

  • Submissions should contain enough detail for peer review and must not substantially duplicate work submitted to another journal or conference proceedings.

    Accepted papers will appear in Springer Lecture Notes in Computer Science (LNCS). The final versions of accepted papers must be typeset in \LaTeX\ using the LNCS style.

Conference Proceedings

  • Proceedings of the conference will be published in Springer-Verlag’s Lecture Notes in Computer Science series, and will be available at the conference.