Sequences and their Applications

Proceedings of SETA ’98

  • C. Ding
  • T. Helleseth
  • H. Niederreiter
Conference proceedings

DOI: 10.1007/978-1-4471-0551-0

Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)

Table of contents

  1. Front Matter
    Pages I-IX
  2. Jean-Paul Allouche, Jeffrey Shallit
    Pages 1-16
  3. Anchung Chang, Solomon W. Golomb, Guang Gong, P. Vijay Kumar
    Pages 17-38
  4. Dilip V. Sarwate
    Pages 79-102
  5. N. J. A. Sloane
    Pages 103-130
  6. A. Frid, S. V. Avgustinovich
    Pages 191-204
  7. John B. Friedlander, Daniel Lieman, Igor E. Shparlinski
    Pages 205-212
  8. Jovan Dj. Golić, Renato Menicocci
    Pages 213-227
  9. Fritz Von Haeseler, Wibke Jürgensen
    Pages 228-239
  10. T. Helleseth, P. V. Kumar, H. M. Martinsen, O. N. Vassbakk
    Pages 240-253

About these proceedings

Keywords

AES algorithms bridge code coding theory communication complexity

Editors and affiliations

  • C. Ding
    • 1
  • T. Helleseth
    • 2
  • H. Niederreiter
    • 3
  1. 1.Department of Computer Science, School of ComputingNational University of SingaporeSingapore
  2. 2.Department of InformaticsUniversity of BergenBergenNorway
  3. 3.Institute of Information ProcessingAustrian Academy of SciencesViennaAustria

Bibliographic information

  • Copyright Information Springer-Verlag London Limited 1999
  • Publisher Name Springer, London
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-85233-196-2
  • Online ISBN 978-1-4471-0551-0