Results 41 to 50 of about 12,115,560 (297)
Deterministic Construction of Compressed Sensing Matrices via Vector Spaces Over Finite Fields
IEEE Access, 2020 Compressed Sensing (CS) is a new signal processing theory under the condition that the signal is sparse or compressible. One of the central problems in compressed sensing is the construction of sensing matrices.
Xuemei Liu, Lihua Jia
doaj +1 more source
Visibly Irreducible Polynomials over Finite Fields [PDF]
The American Mathematical Monthly, 2020 11 pages.
openaire +2 more sources
Characterization and Enumeration of Good Punctured Polynomials over Finite Fields
International Journal of Mathematics and Mathematical Sciences, 2016 A family of good punctured polynomials is introduced. The complete characterization and enumeration of such polynomials are given over the binary field F2.
Somphong Jitman +4 more
doaj +1 more source
Stable polynomials over finite fields
Revista Matemática Iberoamericana, 2014 We use the theory of resultants to study the stability, that is, the property of having all iterates irreducible, of an arbitrary polynomial f over a finite field \mathbb{F}_q
Gómez Pérez, Domingo +3 more
openaire +5 more sources
Factorization of Dickson polynomials over finite fields
São Paulo Journal of Mathematical Sciences, 2021 Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these polynomials in the case that every prime divisor of $n$ divides $q-1$.
Nelcy Esperanza Arévalo Baquero +1 more
openaire +2 more sources
Constructing irreducible polynomials with prescribed level curves over finite fields
International Journal of Mathematics and Mathematical Sciences, 2001 We use Eisenstein's irreducibility criterion to prove that there exists an absolutely irreducible polynomial P(X,Y)∈GF(q)[X,Y] with coefficients in the finite field GF(q) with q elements, with prescribed level curves Xc:={(x,y)∈GF(q)2|P(x,y)=c}.
Mihai Caragiu
doaj +1 more source
Hall polynomials for the representation-finite hereditary algebras [PDF]
, 1990 Ringel CM. Hall polynomials for the representation-finite hereditary algebras. Advances in mathematics.
Ringel, Claus Michael
core +1 more source
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
IEEE Access, 2021 A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small
Sergei Valentinovich Fedorenko
doaj +1 more source
Advanced Functional Materials, EarlyView.ABSTRACT Chitosan, a polysaccharide upcycled from biowaste, has long promised sustainable, biocompatible, and antimicrobial films and devices, an appeal reinforced by its recent regulatory recognition, with several chitosan‐based antibacterial dressings gaining clearance through the Food and Drug Administration's 510(k) pathway.
Jacopo Nicoletti +16 more
wiley +1 more source
Fixed Points of the Dickson Polynomials of the Second Kind
Journal of Applied Mathematics, 2013 The permutation behavior of Dickson polynomials of the first kind has been extensively studied, while such behavior for Dickson polynomials of the second kind is less known.
Adama Diene, Mohamed A. Salim
doaj +1 more source