Advertisement

Sequences, Subsequences, and Consequences

International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007, Revised Invited Papers

  • Editors
  • Solomon W. Golomb
  • Guang Gong
  • Tor Helleseth
  • Hong-Yeop Song

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

Table of contents

  1. Front Matter
  2. Matthew G. Parker, Alexander Pott
    Pages 9-23
  3. Daniel Goldstein, Alfred W. Hales
    Pages 24-36
  4. Tor Helleseth, Alexander Kholosha
    Pages 50-61
  5. Xiaohu Tang, Tor Helleseth, Lei Hu, Wenfeng Jiang
    Pages 62-69
  6. Reza Omrani, Pankaj Bhambhani, P. Vijay Kumar
    Pages 95-105
  7. Tuvi Etzion
    Pages 129-133
  8. Andrew Viterbi
    Pages 147-152
  9. Robert J. McEliece, Sarah L. Sweatlock
    Pages 153-161
  10. H. Fredricksen, E. J. Ionascu, F. Luca, P. Stănică
    Pages 162-168
  11. Sondre Rønjom, Tor Helleseth
    Pages 169-183
  12. Sung-Jun Yoon, Hong-Yeop Song
    Pages 184-191
  13. Sondre Rønjom, Guang Gong, Tor Helleseth
    Pages 204-217
  14. Back Matter

About these proceedings

Introduction

These are the proceedings of the Workshop on Sequences, Subsequences, and Consequences that was held at the University of Southern California (USC), May 31 - June 2, 2007. There were three one-hour Keynote lectures, 16 invited talks of up to 45 minutes each, and 1 “contributed” paper. The theory of sequences from discrete symbol alphabets has found practical applications in many areas of coded communications and in cryptography, - cluding: signal patterns for use in radar and sonar; spectral spreading sequences for CDMA wireless telephony; key streams for direct sequence stream-cipher cryptography; and a variety of forward-error-correctingcodes. The workshopwasdesigned to bring leading researcherson “sequences”from aroundtheworldtopresenttheirlatestresults,interchangeinformationwithone another, and especially to inform the larger audience of interested participants, includingfaculty,researchers,scholars,andstudentsfromnumerousinstitutions, as well as the readers of these proceedings, about recent developments in this important ?eld. There were invited speakers from Canada, China, Germany, India, Israel, Norway, Puerto Rico, and South Korea, in addition to those from the USA. Support for the workshop was generously provided by the O?ce of the Dean of the Viterbi School of Engineering, by the Center for Communications Research (CCR-La Jolla), and by the United States National Science Foundation (NSF). This support is hereby gratefully acknowledged.

Keywords

Boolean function Error-correcting Code Golomb conjecture Symbol bent function binary sequence communication complexity cryptography digital watermarking directed graph double-periodic arrrays filter generator finite field mobile communication

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-77404-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-77403-7
  • Online ISBN 978-3-540-77404-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site