English
Related papers

Related papers: A Class of Random Sequences for Key Generation

200 papers

Gene gain-loss-duplication models are commonly based on continuous-time birth-death processes. Employed in a phylogenetic context, such models have been increasingly popular in studies of gene content evolution across multiple genomes.…

Populations and Evolution · Quantitative Biology 2021-07-27 Miklos Csuros

A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…

Combinatorics · Mathematics 2014-07-09 Nicolas T. Courtois , Gregory V. Bard , Shaun V. Ault

Randomness is an essential resource and plays important roles in various applications ranging from cryptography to simulation of complex systems. Certified randomness from quantum process is ensured to have the element of privacy but…

Quantum Physics · Physics 2024-11-14 Jinfang Zhang , Yi Li , Mengyu Zhao , Dongmei Han , Jun Liu , Meihong Wang , Qihuang Gong , Yu Xiang , Qiongyi He , Xiaolong Su

D. S. Hong and P. Pongsriiam have provided a necessary and sufficient condition for the generating function for Fibonacci numbers (resp. the Lucas numbers) to be an integer value, for rational numbers. In other words, their results relate…

Number Theory · Mathematics 2019-09-16 Yuji Tsuno

This paper proposes a general method for improving the structure and quality of sequences generated by a recurrent neural network (RNN), while maintaining information originally learned from data, as well as sample diversity. An RNN is…

Let $p$ be an odd prime with $2$-adic expansion $\sum_{i=0}^kp_i\cdot2^i$. For a sequence $\underline{a}=(a(t))_{t\ge 0}$ over $\mathbb{F}_{p}$, each $a(t)$ belongs to $\{0,1,\ldots, p-1\}$ and has a unique $2$-adic expansion…

Information Theory · Computer Science 2014-02-20 Yupeng Jiang , DongDai Lin

In this paper we establish some sophisticated congruences involving central binomial coefficients and Fibonacci numbers. For example, we show that if $p\not=2,5$ is a prime then $$\sum_{k=0}^{p-1}F_{2k}\binom{2k}{k}=(-1)^{[p/5]}(1-(p/5))…

Number Theory · Mathematics 2009-12-20 Zhi-Wei Sun

Generative models reliant on sequential autoregression have been at the forefront of language generation for an extensive period, particularly following the introduction of widely acclaimed transformers. Despite its excellent performance,…

Computation and Language · Computer Science 2024-06-21 Yaguang Li , Xin Chen

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Number Theory · Mathematics 2020-05-19 Arne Winterhof , Zibi Xiao

Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…

Combinatorics · Mathematics 2020-10-13 Ömer Eğecioğlu , Vesna Iršič

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4p-3$, $p$ is a prime number, then it has a subsequence of length $p$, whose sum is $0$ modulo $p$. It is known that in $Z_{p}^{3}$ to get a…

Number Theory · Mathematics 2014-09-10 Satwik Mukherjee

For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for…

Number Theory · Mathematics 2018-01-22 Paul Cubre , Jeremy Rouse

A Monte Carlo algorithm is said to be adaptive if it automatically calibrates its current proposal distribution using past simulations. The choice of the parametric family that defines the set of proposal distributions is critical for good…

Statistics Theory · Mathematics 2011-11-11 Christian Schäfer , Nicolas Chopin

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

Number Theory · Mathematics 2015-06-26 P. Kurlberg , C. Pomerance

Sequences with low aperiodic autocorrelation are used in communications and remote sensing for synchronization and ranging. The autocorrelation demerit factor of a sequence is the sum of the squared magnitudes of its autocorrelation values…

Information Theory · Computer Science 2024-08-19 Daniel J. Katz , Miriam E. Ramirez

Segmental structure is a common pattern in many types of sequences such as phrases in human languages. In this paper, we present a probabilistic model for sequences via their segmentations. The probability of a segmented sequence is…

Machine Learning · Statistics 2018-07-20 Chong Wang , Yining Wang , Po-Sen Huang , Abdelrahman Mohamed , Dengyong Zhou , Li Deng

Informally, an extractor delivers perfect randomness from a source that may be far away from the uniform distribution, yet contains some randomness. This task is a crucial ingredient of any attempt to produce perfectly random…

Information Theory · Computer Science 2012-12-04 Wolfgang Mauerer , Christopher Portmann , Volkher B. Scholz

Automatic generation of sequences has been a highly explored field in the last years. In particular, natural language processing and automatic music composition have gained importance due to the recent advances in machine learning and…

Sound · Computer Science 2020-12-03 Sebastian Garcia-Valencia , Alejandro Betancourt , Juan G. Lalinde-Pulido

A simple binary model to compute the degree of balancedness in the output sequence of LFSR-combinational generators has been developed. The computational method is based exclusively on the handling of binary strings by means of logic…

Cryptography and Security · Computer Science 2010-05-14 Amparo Fúster-Sabater , Pedro García-Mochales

Be d_{m,n} a generic element in the infinite matrix D, with d_{1, n} defined as the n-th prime number and, for any m>1, d_{m, n} = | d_{m-1, n} - d_{m-1, n+1} | When n>1, after the first few terms the columns in the matrix appear to be…

Number Theory · Mathematics 2016-07-20 Raffaele Salvia
‹ Prev 1 8 9 10 Next ›