Sequences and their Applications

1. Front Matter

   Pages I-VIII

   PDF

2. Invited Contributions

   1. Uniformly Representable Permutation Polynomials

      • Hans Dobbertin

      Pages 1-22

   2. New p-ary Perfect Sequences and Difference Sets with Singer Parameters

      • J. F. Dillon

      Pages 23-33

   3. On the Crosscorrelation of m-Sequences and Related Sequences with Ideal Autocorrelation

      • Tor Helleseth

      Pages 34-45

   4. Sequences for OFDM and Multi-Code CDMA: Two Problems in Algebraic Coding Theory

      • Kenneth G. Paterson

      Pages 46-71

   5. Signal Design for Ultra-wideband Radio

      • Robert A. Scholtz, P. Vijay Kumar, Carlos J. Corrada-Bravo

      Pages 72-87

   6. Constructions of Sequences from Algebraic Curves over Finite Fields

      • Chaoping Xing

      Pages 88-100

3. Regular Contributions

   1. Description of Binary Sequences Based on the Interval Linear Complexity Profile

      • Vladimir B. Balakirsky

      Pages 101-115

   2. On the Number of Kernel Elements of Automatic Sequences

      • André Barbé, Fritz von Haeseler

      Pages 116-130

   3. On the Coset Weight Divisibility and Nonlinearity of Resilient and Correlation-Immune Functions

      • Claude Carlet

      Pages 131-144

   4. On the Linear Complexity of Generalised Legendre Sequence

      • Zongduo Dai, Junhui Yang, Guang Gong, Ping Wang

      Pages 145-153

   5. Hyper-Cyclotomic Algebra

      • Solomon W. Golomb, Guang Gong

      Pages 154-165

   6. Cyclic Projective Planes, Perfect Circular Rulers, and Good Spanning Rulers

      • Solomon W. Golomb, Herbert Taylor

      Pages 166-181

   7. Linear Recursive Sequences over Elliptic Curves

      • Guang Gong, Charles C. Y. Lam

      Pages 182-196

   8. On the Distinctness of Decimations of ℓ-Sequences

      • Mark Goresky, Andrew Klapper, Ram Murty

      Pages 197-208

   9. On Binary Sequences of Period n = pm ∓ 1 with Optimal Autocorrelation

      • Tor Helleseth, Kyeongcheol Yang

      Pages 209-217

   10. On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p ^m) with Period p ⁿ

       • Takayasu Kaida, Satoshi Uehara, Kyoki Imamura

       Pages 218-227

   11. Constant Sum Implies Statistical Independence of Chaotic Sequences

       • Tohru Kohda

       Pages 228-241

   12. First-Order Optimal Approximation of Binary Sequences

       • Nicholas Kolokotronis, Panagiotis Rizomiliotis, Nicholas Kalouptsidis

       Pages 242-256

   13. On the Uniformity of Distribution of Congruential Generators over Elliptic Curves

       • Edwin El Mahassni, Igor Shparlinski

       Pages 257-264

Pseudorandom sequences have widespread applications, for instance, in spread spectrum, code division multiple access, optical and ultrawide band communication systems, as well as in ranging systems global positioning systems, circuit testing and stream ciphers. Such sequences also have strong ties to error-correcting codes.
This volume contains survey and research papers on sequences and their applications. It brings together leading experts from discrete mathematics, computer science and communications engineering, and helps to bridge advances in these different areas. Papers in this volume discuss the theory of sequences and their applications in cryptography, coding theory, communications systems, numerical computation and computer simulation.

• Communications systems
• Cryptography
• Numerical Compution and Simulation
• Sequences and Coding
• Stream Ciphers
• bridge
• coding theory
• communication
• differential equation

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

  T. Helleseth

• Communication Sciences Institute, Department of Electrical Engineering Systems, University of Southern California, Los Angeles, USA

  P. V. Kumar

• Department of Electronic and Electrical Engineering, Pohang University of Science and Technology (POSTECH), Pohang, Kyungbuk, Korea

  K. Yang

Policies and ethics