Mathematical properties of sequences and other combinatorial structures

Author(s)
Bibliographic Information

Mathematical properties of sequences and other combinatorial structures

edited by Jong-Seon No ... [et al.]

(The Kluwer international series in engineering and computer science, 726)

Kluwer Academic, c2003

Search this Book/Journal
Note

"A collection of papers presented in the three-day conference, held in Los Angeles, May 30 - June 1, 2002, celebrating the 70th birthday of Professor Solomon W. Golomb"-Preface

Includes bibliographical references and index

Description and Table of Contents

Description

Mathematical Properties of Sequences and Other Combinatorial Structures is an excellent reference for both professional and academic researchers working in telecommunications, cryptography, signal processing, discrete mathematics, and information theory. The work represents a collection of contributions from leading experts in the field. Contributors have individually and collectively dedicated their work as a tribute to the outstanding work of Solomon W. Golomb. Mathematical Properties of Sequences and Other Combinatorial Structures covers the latest advances in the widely used and rapidly developing field of information and communication technology.

Table of Contents

  • Preface. Introduction
  • E. Berlekamp. Pairs of m sequences with a six-valued crosscorrelation
  • T. Helleseth. Permutation polynomials, Tuscan-k arrays and Costas sequences
  • Wensong Chu. Periods of piecewise-linear recurrences
  • B. Gordon. Trace representation of Hall's sextic residue sequences of period p= 7 (mod 8)
  • Jeong-Heon Kim, Hong-Yeop Song, Guang Gong. Array correlation and sequences with equal magnitude correlation
  • Guang Gong. Singly periodic Costas arrays are equivalent to polygonal path Vatican squares
  • H. Taylor. Survey on Costas arrays and their generalizations
  • O. Moreno. On p-ary bent functions defined on finite fields
  • Young-Sik Kim, Ji-Woong Jang, Jong-Seong No, T. Helleseth. Distribution of r-patterns in the highest level of p-ADIC expansion of some linear recursion sequences over Galois rings
  • Zongduo Dai, Dingfeng Ye, Ping Wang, Genxi Fang. On edit distance attack to alternating step generator
  • Shaoquan Jiang, Guang Gong. Polyomino number theory (II)
  • U. Barbans, A. Cibulis, G. Lee, A. Liu, R. Wainwright. Achievement games for polyomines on Archimedean tessellations
  • J.-P. Bode, H. Harborth. What's new in polyomino puzzles and their design
  • S. Coffin, J. Slocum. Euler sums revisited
  • T.M. Apostol. Hardy-Littlewood constants
  • K. Conrad. On the parity of permutation
  • D. Singmaster. Irreducibles of tetranomial type
  • A.W. Hales, D.W. Newhart. A method of deterministically generating block substitution tables which meet a given standard of nonlinearity
  • L. Mittenthal. Tilings with generalized Lee spheres
  • T. Etzion. On the connections between RSA cryptosystem and the Fibonacci numbers
  • J. Denes, T. Denes. Removing autocorrelation sidelobesby overlaying orthogonal coding on any train of identical pulses
  • N. Levanon, E. Mozeson. An analytic performance model
  • J.J. Stiffler. PN signal acquisition and convolution via the characters of the additive group
  • L.R. Welch. Golomb's reminiscences
  • S.W. Golomb. Index.

by "Nielsen BookData"

Related Books: 1-1 of 1
Details
Page Top