Skip to main content
SpringerLink
Log in

Sequences and their Applications

Proceedings of SETA ’98

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. C. Ding

    1. Department of Computer Science, School of Computing, National University of Singapore, Singapore

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. T. Helleseth

    1. Department of Informatics, University of Bergen, Bergen, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. H. Niederreiter

    1. Institute of Information Processing, Austrian Academy of Sciences, Vienna, Austria

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Pages I-IX
    Download chapter PDF

  2. The Ubiquitous Prouhet-Thue-Morse Sequence

    • Jean-Paul Allouche, Jeffrey Shallit
    Pages 1-16

  3. On Ideal Autocorrelation Sequences Arising from Hyperovals

    • Anchung Chang, Solomon W. Golomb, Guang Gong, P. Vijay Kumar
    Pages 17-38

  4. Cyclic Hadamard Difference Sets — Constructions and Applications

    • Solomon W. Golomb
    Pages 39-48

  5. Correlation of m-Sequences and Related Topics

    • Tor Helleseth
    Pages 49-66

  6. Some Computable Complexity Measures for Binary Sequences

    • Harald Niederreiter
    Pages 67-78

  7. Meeting the Welch Bound with Equality

    • Dilip V. Sarwate
    Pages 79-102

  8. My Favorite Integer Sequences

    • N. J. A. Sloane
    Pages 103-130

  9. Complementary Interpolants and a Welch-Berlekamp-style Algorithm

    • Marc André Armand
    Pages 131-145

  10. Multiscale Coarse-graining Invariant Sequences

    • André Barbé
    Pages 146-160

  11. Regular Cosets and Upper Bounds on the Linear Complexity of Certain Sequences

    • P. Caballero-Gil
    Pages 161-170

  12. Hadamard Matrices, Self-Dual Codes Over the Integers Modulo 4 and their Gray Images

    • C. Charnes
    Pages 171-183

  13. On Constructing Balanced Correlation Immune Functions

    • Thomas W. Cusick
    Pages 184-190

  14. On Bispecial Words and Subword Complexity of DOL Sequences *

    • A. Frid, S. V. Avgustinovich
    Pages 191-204

  15. On the Distribution of the RSA Generator

    • John B. Friedlander, Daniel Lieman, Igor E. Shparlinski
    Pages 205-212

  16. Edit Probability Correlation Attack on the Alternating Step Generator

    • Jovan Dj. Golić, Renato Menicocci
    Pages 213-227

  17. Automaticity of Solutions of Mahler Equations

    • Fritz Von Haeseler, Wibke Jürgensen
    Pages 228-239

  18. Correlation Distribution of the Quaternary Kasami Sequences*

    • T. Helleseth, P. V. Kumar, H. M. Martinsen, O. N. Vassbakk
    Pages 240-253

  19. Multicovering Radii of Reed-Muller Codes and the Existence of Secure Stream Ciphers (Extended Abstract)

    • Iiro Honkala, Andrew Klapper
    Pages 254-262

  20. Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k

    • Tetsu Iwata, Kaoru Kurosawa
    Pages 263-272
Back to top

Keywords

Editors and Affiliations

  • Department of Computer Science, School of Computing, National University of Singapore, Singapore

    C. Ding

  • Department of Informatics, University of Bergen, Bergen, Norway

    T. Helleseth

  • Institute of Information Processing, Austrian Academy of Sciences, Vienna, Austria

    H. Niederreiter

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation