Sequences and Their Applications - SETA 2004

Third International Conference, Seoul, Korea, October 24-28, 2004. Revised Selected Papers

  • Tor Helleseth
  • Dilip Sarwate
  • Hong-Yeop Song
  • Kyeongcheol Yang
Conference proceedings SETA 2004

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3486)

Table of contents

  1. Front Matter
  2. Invited Papers

    1. Hans Dobbertin, Gregor Leander
      Pages 1-29
    2. Matthew G. Parker
      Pages 72-100
  3. Complexity of Sequences I

  4. Complexity of Sequences II

  5. Perfect Sequences

  6. Sequence Constructions

    1. Evgeny I. Krengel, Andrew Z. Tirkel, Tom E. Hall
      Pages 220-235
    2. San Ling, Ferruh Özbudak
      Pages 236-242
    3. Xiaohu Tang, Parampalli Udaya, Pingzhi Fan
      Pages 243-254
  7. Sequences over ℤ m

About these proceedings

Introduction

This volume contains the refereed proceedings of the 3rd International Conf- ence on Sequences and Their Applications (SETA 2004), held in Seoul, Korea during October 24–28, 2004. The previous two conferences, SETA 1998 and SETA 2001, were held in Singapore and Bergen, Norway, respectively. These conferences are motivated by the many widespread applications of sequences in modern communication systems. These applications include pseudorandom sequences in spread spectrum systems, code-division multiple-access, stream ciphers in cryptography and several connections to coding theory. The Technical Program Committee of SETA 2004 received 59 submitted - pers, many more than the submissions to previous SETA conferences. The C- mittee therefore had the di?cult task of selecting the 33 papers to be presented at the Conference in addition to four invited papers. The authors of papers p- sented at the conference were invited to submit full papers that were refereed before appearing in this proceedings. These proceedings have been edited by the Co-chairs of the Technical P- gram Committee for SETA 2004: Tor Helleseth of the University of Bergen, Norway, and Dilip Sarwate of the University of Illinois at Urbana-Champaign, USA, and Technical Program Committee members Hong-Yeop Song of Yonsei University, Korea, and Kyeongcheol Yang of Pohang University of Science and Technology, Korea.

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

Editors and affiliations

  • Tor Helleseth
    • 1
  • Dilip Sarwate
    • 2
  • Hong-Yeop Song
    • 3
  • Kyeongcheol Yang
    • 4
  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.University of Ilinois at Urbana-ChampaignUrbanaUSA
  3. 3.Department of Electrical and Electronic EngineeringYonsei UniversitySeoulKorea
  4. 4.Dept. of Electronics and Electrical EngineeringPohang University of Science and Technology (POSTECH)PohangKorea

Bibliographic information

  • DOI https://doi.org/10.1007/b136167
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-26084-4
  • Online ISBN 978-3-540-32048-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications