Mathematical Properties of Sequences and Other Combinatorial Structures, Softcover reprint of the original 1st ed. 2003
The Springer International Series in Engineering and Computer Science Series, Vol. 726

Coordinators: Jong-Seon No , Hong-Yeop Song , Helleseth Tor, Kumar P. Vijay

Language: English

105.49 €

In Print (Delivery period: 15 days).

Add to cartAdd to cart
Mathematical Properties of Sequences and Other Combinatorial Structures
Publication date:
248 p. · 15.5x23.5 cm · Paperback

Approximative price 105.49 €

Subject to availability at the publisher.

Add to cartAdd to cart
Mathematical properties of sequences & other combinatorial structures (Series in engineering & computer science, Vol. 726)
Publication date:
248 p. · 15.5x23.5 cm · Hardback

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.

Pairs of m-Sequences With A Six-Valued Crosscorrelation.- Permutation Polynomials, Tuscan-k Arrays and Costas Sequences.- Periods of Piecewise-Linear Recurrences.- Trace Representation of Hall’s Sextic Residue Sequences of Period p ? 7 (mod 8).- Array Correlation and Sequences with Equal Magnitude Correlation.- Singly Periodic Costas Arrays Are Equivalent to Polygonal Path Vatican Squares.- Survey on Costas Arrays and Their Generalizations.- On p-Ary Bent Functions Defined on Finite Fields.- Distribution of r-Patterns in the Highest Level of p-Adic Expansion of Some Linear Recursion Sequences Over Galois Rings.- On Edit Distance Attack to Alternating Step Generator.- Polyomino Number Theory (II).- Achievement Games for Polyominoes on Archimedean Tessellations.- What’s New in Polyomino Puzzles and Their Design.- Euler Sums Revisited.- Hardy-Littlewood Constants.- On The Parity of Permutation.- Irreducibles of Tetranomial Type.- A Method of Deterministically Generating Block Substitution Tables Which Meet a Given Standard of Nonlinearity.- Tilings With Generalized Lee Spheres.- On the Connections Between Rsa Cryptosystem and The Fibonacci Numbers.- Removing Autocorrelation Sidelobes by Overlaying Orthogonal Coding on Any Train of Identical Pulses.- An Analytic Cache Performance Model.- PN Signal Acquisition and Convolution Via the Characters of the Additive Group.- Golomb’s Reminiscences.