Results 1 to 10 of about 8,955,762 (211)

Features of digital signal processing algorithms using Galois fields GF(2n+1). [PDF]

open access: yesPLoS 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

On generalized bihyperbolic Mersenne numbers [PDF]

open access: yesMathematica Bohemica, 2023
In this paper, a new generalization of Mersenne bihyperbolic numbers is introduced. Some of the properties of presented numbers are given. A general bilinear index-reduction formula for the generalized bihyperbolic Mersenne numbers is obtained.
Dorota Bród, Anetta Szynal-Liana
doaj   +2 more sources

The generalized order (k,t)-Mersenne sequences in groups [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
The purpose of this paper is to determine the algebraic properties of finite groups via a Mersenne-like sequence. Firstly, we introduce the generalized order (k,t)-Mersenne number sequences and study the periods of these sequences modulo m.
E. Mehraban, Ö. Deveci, E. Hincal
doaj   +3 more sources

Secure image exchange over cloud networks with neural key exchange protocol [PDF]

open access: yesScientific Reports
In this article, a novel image encryption algorithm is proposed for the secure transmission and storage of images over the cloud. The robustness of Tree Parity Machines (TPMs) is utilized in conjunction with DNA coding, Mersenne Twister-based DNA ...
Wassim Alexan   +4 more
doaj   +2 more sources

On Mersenne Numbers and their Bihyperbolic Generalizations [PDF]

open access: yesAnnales Mathematicae Silesianae
Abstract In this paper, we introduce Mersenne and Mersenne–Lucas bihyperbolic numbers, i.e. bihyperbolic numbers whose coefficients are consecutive Mersenne and Mersenne–Lucas numbers. Moreover, we study one parameter generalizations of Mersenne and Mersenne–Lucas bihyperbolic numbers.
Dorota Bród, Anetta Szynal-Liana
openaire   +3 more sources

The specifics of the Galois field GF(257) and its use for digital signal processing [PDF]

open access: yesScientific Reports
An 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

Learned pseudo-random number generator: WGAN-GP for generating statistically robust random numbers. [PDF]

open access: yesPLoS 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

A Study of Determinants and Inverses for Periodic Tridiagonal Toeplitz Matrices with Perturbed Corners Involving Mersenne Numbers

open access: yesMathematics, 2019
In this paper, we study periodic tridiagonal Toeplitz matrices with perturbed corners. By using some matrix transformations, the Schur complement and matrix decompositions techniques, as well as the Sherman-Morrison-Woodbury formula, we derive explicit ...
Zhaolin Jiang, Yunlan Wei
exaly   +3 more sources

Performances and Fatigue Responses to Weighted Vest Training in Parkour Novices. [PDF]

open access: yesEur J Sport Sci
ABSTRACT Weighted vest training has demonstrated benefits for muscle strength, which is critical for parkour performance. However, the acute effects of external loading in this discipline remain poorly understood. This study investigated the impact of weighted vest use during parkour sessions on lower‐limb performance, perceived exertion, and muscle ...
Grosprêtre S   +5 more
europepmc   +2 more sources

Mersenne Numbers: consolidated results [PDF]

open access: yes, 1986
This document provides and comments on the results of the Lucas-Lehmer testing and/or partial factorisation of all Mersenne Numbers Mp = 2^p-1 where p is prime and less than 100,000. Previous computations have either been confirmed or corrected.
Hunt, David   +4 more
core   +5 more sources

Home - About - Disclaimer - Privacy