Linear Complexity of Geometric Sequences Defined by Cyclotomic Classes and Balanced Binary Sequences Constructed by the Geometric Sequences [PDF]
Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field.
arxiv +1 more source
Application of Sequence Embedding in Protein Sequence-Based Predictions [PDF]
In sequence-based predictions, conventionally an input sequence is represented by a multiple sequence alignment (MSA) or a representation derived from MSA, such as a position-specific scoring matrix. Recently, inspired by the development in natural language processing, several applications of sequence embedding have been observed.
arxiv
Pseudorandom binary sequences: quality measures and number-theoretic constructions [PDF]
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity, correlation measure of order $k$, expansion complexity and $2$-adic complexity.
arxiv
Another Set of Sequences, Sub-Sequences, and Sequences of Sequences [PDF]
In this paper 101 new integer sequences, sub-sequences, and sequences of sequences, together with related unsolved problems and conjectures, are presented. Also, definitions, examples, solved or open questions, and references for each sequence are given.
arxiv
Integer Sequences: Irregular Arrays and Intra-Block Permutations [PDF]
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor diagonal method is proposed. We also define and describe intra-block permutations of natural numbers. Generalizations
arxiv
Identities for second order recurrence sequences [PDF]
We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence, the sequence of Lucas numbers, the Jacobsthal sequence, the Jacobsthal-Lucas sequence, the Pell sequence and the ...
arxiv
Interleaved sequences of geometric sequences binarized with Legendre symbol of two types [PDF]
A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field.
arxiv +1 more source
Next‐generation sequencing for mitochondrial disorders [PDF]
A great deal of our understanding of mitochondrial function has come from studies of inherited mitochondrial diseases, but still majority of the patients lack molecular diagnosis. Furthermore, effective treatments for mitochondrial disorders do not exist.
Anu Suomalainen+2 more
openaire +3 more sources
nCk sequences and their difference sequences [PDF]
A nCk sequence is a sequence of n-bit numbers with k bits set. Given such a sequence C, the difference sequence D of C is subject to certain regularities that make it possible to generate D in 2|C| time, and, hence, to generate C in 3|C| time.
arxiv
Identities for Tribonacci-related sequences [PDF]
We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci sequence. Defining a matrix that we call Tribomatrix, which extends the Fibonacci matrix, we see that the other sequence ...
arxiv