𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Mathematical Properties of Sequences and other Combinatorial Structures

✍ Scribed by No J.-S., Song H.-E., Helleset T., Kumar P.V. (eds.)


Tongue
English
Leaves
133
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Π˜Π·Π΄Π°Ρ‚Π΅Π»ΡŒΡΡ‚Π²ΠΎ Kluwer, 2003, -133 pp.

This proceedings is for the most part, a collection of papers presented in the three-day onference, held in Los Angeles, May 30 - June 1,2002, celebrating the 70th bIrthday of Professor Solomon W. Golomb. All contributions to the proceedings were peer-reviewed. Reflecting the interests of Professor Golomb, the major topics include sequences and combinatorial structures and range in treatment from pure theory" to application-oriented", from a short and concise presentation of results to a more comprehensive tutorial treatment.
Introduction
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 (ll)
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

✦ Subjects


ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;ДискрСтная ΠΌΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°


πŸ“œ SIMILAR VOLUMES


Mathematical Properties of Sequences and
✍ Tor Helleseth (auth.), Jong-Seon No, Hong-Yeop Song, Tor Helleseth, P. Vijay Kum πŸ“‚ Library πŸ“… 2003 πŸ› Springer US 🌐 English

<p><P><STRONG>Mathematical Properties of Sequences and Other Combinatorial Structures</STRONG> is an excellent reference for both professional and academic researchers working in telecommunications, cryptography, signal processing, discrete mathematics, and information theory. </P><P>The work repres

Combinatorics 1984: Finite Geometries an
✍ M. Biliotti, A. Cossu, G. Korchmaros, A. Barlotti, G. Tallini πŸ“‚ Library πŸ“… 1986 πŸ› Elsevier Science Ltd 🌐 English

Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology. The 38 papers in this volume survey the state of the art and report on recent results in Combinatorial Geometries and their applications.<p>Contributors: V. Abat

Combinatorics 1984: Finite Geometries an
✍ A. Barlotti, etc., M. Biliotti, G. Korchmaros, G. Tallini πŸ“‚ Library πŸ“… 1986 πŸ› Elsevier, Academic Press 🌐 English

Interest in combinatorial techniques has been greatly enhanced by the applications they may offer in connection with computer technology. The 38 papers in this volume survey the state of the art and report on recent results in Combinatorial Geometries and their applications.Contributors: V. Abatange

Combinatorics and Number Theory of Count
✍ Istvan Mezo πŸ“‚ Library πŸ“… 2019 πŸ› Chapman and Hall/CRC 🌐 English

<p><strong><em>Combinatorics and Number Theory of Counting Sequences</em></strong> is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations.</p> <p>The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book