We consider modeling a dependent sequence of random partitions. It is well known in Bayesian nonparametrics that measure discrete type induces distribution over The...

The article discusses various options for constructing binary generators of pseudo-random numbers (PRN) based on the so-called generalized Galois and Fibonacci matrices. terms "Galois matrix" "Fibonacci are borrowed from theory cryptography, in which linear feedback shift registers (LFSR) PRN according to schemes widely used. matrix generate identical sequences as LFSR generators. transition cl...

a non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized fibonacci sequence , , , . a remarkable application of this definition may be find on the study of random covers in the cryptography. the 2-step generalized sequences for the dihedral groups studied for their pe...

Binary Golay sequence pairs exist for lengths 2, 10 and 26 and, by Turyn’s product construction, for all lengths of the form 21026 where a, b, c are non-negative integers. Computer search has shown that all inequivalent binary Golay sequence pairs of length less than 100 can be constructed from five “seed” pairs, of length 2, 10, 10, 20 and 26. We give the first complete explanation of the orig...