Results 1 to 10 of about 13,581 (195)
Features of digital signal processing algorithms using Galois fields GF(2n+1). [PDF]
PLoS ONE, 2023 An alternating representation of integers in binary form is proposed, in which the numbers -1 and +1 are used instead of zeros and ones. It is shown that such a representation creates considerable convenience for multiplication numbers modulo p = 2n+1 ...
Ibragim E Suleimenov +2 more
doaj +2 more sources
Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers. [PDF]
PLoS ONE, 2023 Pseudo-random number generators (PRNGs) are software algorithms generating a sequence of numbers approximating the properties of random numbers. They are critical components in many information systems that require unpredictable and nonarbitrary ...
Kiyoshiro Okada +3 more
doaj +2 more sources
The specifics of the Galois field GF(257) and its use for digital signal processing [PDF]
Scientific ReportsAn algorithm of digital logarithm calculation for the Galois field $$GF(257)$$ G F ( 257 ) is proposed. It is shown that this field is coupled with one of the most important existing standards that uses a digital representation of the signal through 256 ...
Akhat Bakirov +4 more
doaj +2 more sources
Mersenne version of Brocard-Ramanujan equation
Journal of New Results in Science, 2023 In this study, we deal with a special form of the Brocard-Ramanujan equation, which is one of the interesting and still open problems of Diophantine analysis.
Ayşe Nalli, Seyran İbrahimov
doaj +1 more source
Fermat and Mersenne numbers in $k$-Pell sequence
Математичні Студії, 2021 For an integer $k\geq 2$, let $(P_n^{(k)})_{n\geq 2-k}$ be the $k$-generalized Pell sequence, which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is defined by the recurrence $ P_n^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\cdots +P_{n-k}^{(k)}
B. Normenyo, S. Rihane, A. Togbe
doaj +1 more source
On the solution of the exponential Diophantine equation 2x+m2y=z2, for any positive integer m [PDF]
Journal of Hyperstructures, 2023 It is well known that the exponential Diophantine equation 2x+ 1=z2 has the unique solution x=3 and z=3 innon-negative integers, which is closely related to the Catlan's conjecture.
Mridul Dutta, Padma Bhushan Borah
doaj +1 more source
A study on the number of edges of some families of graphs and generalized Mersenne numbers
Ratio Mathematica, 2022 The relationship between the Nandu sequence of the SM family of graphs and the Generalized Mersenne numbers is demonstrated in this study. Nandu sequences are related to the two families of SM sum graphs and SM Balancing graphs.
K.G. Sreekumar +3 more
doaj +1 more source
Radix-22 Algorithm for the Odd New Mersenne Number Transform (ONMNT)
Signals, 2023 This paper introduces a new derivation of the radix-22 fast algorithm for the forward odd new Mersenne number transform (ONMNT) and the inverse odd new Mersenne number transform (IONMNT).
Yousuf Al-Aali +2 more
doaj +1 more source
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo +3 more
doaj +1 more source
HMNT: Hash Function Based on New Mersenne Number Transform
IEEE Access, 2020 In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient ...
Ali Maetouq, Salwani Mohd Daud
doaj +1 more source