Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission
This paper proposes a code defined on a finite ring ℤpM, where pM = 2m−1 is a Mersenne prime, and m is a binary size of ring elements. The code is based on a splitting sequence (splitting set) S, defined for the given multiplier set E=±20, ±21,…, ±2m−1 ...
Dragana Bajić +2 more
doaj +1 more source
Sequences in finite fields yielding divisors of Mersenne, Fermat and Lehmer numbers, I [PDF]
The aim of this work is to present a method using the cyclic sequences {Mₖ},{θₜₖ} and {ψₜₖ} in the finite fields 𝔽_ρ, with ρ a prime, that yield divisors of Mersenne, Fermat and Lehmer numbers.
A. M. S. Ramasamy
doaj +1 more source
ENCICLOPEDIA MATEMATICĂ A CLASELOR DE NUMERE ÎNTREGI [PDF]
Numerele naturale au fascinat dintotdeauna omenirea, ce le-a considerat, pe bună dreptate, ca fiind mai mult decât mijloace de a studia cantităţile, le-a considerat entităţi având o personalitate proprie.
Coman, Marius
core +1 more source
Quantitative Microbial Risk Assessment of Human H5N1 Infection From Consumption of Fluid Cow's Milk
ABSTRACT The spillover of H5N1 clade 2.3.4.4b into dairy cattle has raised concerns over the safety of fluid milk. While no foodborne infection has been reported in humans, this strain has infected at least 70 people, and milk from infected cows is known to be infected by ingestion of multiple other species.
Katherine J. Koebel +7 more
wiley +1 more source
Some new results on the largest cycle consisting of quadratic residues [PDF]
The length of the largest cycle consisting of quadratic residues of a positive integer n is denoted by L(n). In this paper, we have obtained a formula for finding L(p), where p is a prime. Also, we attempt to characterize a prime number p in terms of the
Prabin Das, Pinkimani Goswami
doaj +1 more source
Converting Binary Floating‐Point Numbers to Shortest Decimal Strings: An Experimental Review
ABSTRACT Background When sharing or logging numerical data, we must convert binary floating‐point numbers into their decimal string representations. For example, the number π might become 3.1415927. Engineers have perfected many algorithms for producing such accurate, short strings.
Jaël Champagne Gareau, Daniel Lemire
wiley +1 more source
Complexity Lower Bound for Boolean Functions in the Class of Extended Operator Forms
Starting with the fundamental work of D.E.Muller in 1954, the polynomial representations of Boolean functions are widely investigated in connection with the theory of coding and for the synthesis of circuits of digital devices.
A.S. Baliuk
doaj +1 more source
On the intersections of nilpotent subgroups in simple groups
Abstract Let G$G$ be a finite group and let Hp$H_p$ be a Sylow p$p$‐subgroup of G$G$. A recent conjecture of Lisi and Sabatini asserts the existence of an element x∈G$x \in G$ such that Hp∩Hpx$H_p \cap H_p^x$ is inclusion‐minimal in the set {Hp∩Hpg:g∈G}$\lbrace H_p \cap H_p^g \,:\, g \in G\rbrace$ for every prime p$p$.
Timothy C. Burness, Hong Yi Huang
wiley +1 more source
FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm
With the rapid growth of multimedia communication, protecting image data has become increasingly critical. This article proposes a novel 3‐stage hyperchaos‐based augmented image encryption technique (3SHAIET) that utilizes a three‐stage process with chaotic systems of increasing dimensionality (e.g., six‐dimensional [6D], 8D, and 9D) to enhance ...
Wassim Alexan +6 more
wiley +1 more source
The 25th and 26th Mersenne primes [PDF]
The 25th and 26th Mersenne primes are 2 21701
Noll, Curt, Nickel, Laura
openaire +1 more source

