Sequences and Their Applications – SETA 2012

7th International Conference, Waterloo, ON, Canada, June 4-8, 2012. Proceedings

  • Tor Helleseth
  • Jonathan Jedwab
Conference proceedings SETA 2012
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7280)

Table of contents

  1. Front Matter
  2. Perfect Sequences

    1. Ferruh Özbudak, Oğuz Yayla, C. Cengiz Yıldırım
      Pages 13-24
  3. Finite Fields

    1. Yin Tan, Longjiang Qu, Chik How Tan, Chao Li
      Pages 25-39
    2. Jean-Pierre Flori, Sihem Mesnager
      Pages 40-52
  4. Invited Paper

    1. Jonathan Lutz, Charles J. Colbourn, Violet R. Syrotiuk
      Pages 53-64
  5. Boolean Functions

  6. Golomb 80th Birthday Session (I)

    1. Solomon W. Golomb
      Pages 110-116
    2. Thomas J. Dorsey, Alfred W. Hales
      Pages 117-125
    3. Jonathan Jedwab, Jane Wodlinger
      Pages 126-135
    4. Ana Sălăgean, David Gardner, Raphael Phan
      Pages 136-147
  7. Golomb 80th Birthday Session (II)

    1. Zhengchun Zhou, Xiaohu Tang, Yang Yang, Udaya Parampalli
      Pages 148-158
    2. Santiago Barrera Acevedo, Thomas E. Hall
      Pages 159-167
  8. Linear Complexity

    1. Zhixiong Chen, Domingo Gómez-Pérez
      Pages 181-189
    2. Sartaj Ul Hasan, Daniel Panario, Qiang Wang
      Pages 190-201
  9. Frequency Hopping

    1. Jin-Ho Chung, Kyeongcheol Yang
      Pages 202-211

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 7th International Conference on Sequences and Their Applications, SETA 2012, held in Waterloo, Canada, in June 2012. The 28 full papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 48 submissions. The papers are grouped in topical sections on perfect sequences; finite fields; boolean functions; Golomb 80th birthday session; linear complexity; frequency hopping; correlation of sequences; bounds on sequences, cryptography; aperiodic correlation; and Walsh transform.

Keywords

algebraic cryptanalysis boolean functions linear complexity permutation quaternions

Editors and affiliations

  • Tor Helleseth
    • 1
  • Jonathan Jedwab
    • 2
  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.Department of MathematicsSimon Fraser UniversityBurnabyCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-30615-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-30614-3
  • Online ISBN 978-3-642-30615-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349