Results 1 to 10 of about 10,791,227 (313)
Kode blok adalah skema penyandian yang menggunakan sistem kode-kode pada suatu lapangan hingga dengan panjang yang sama dan tetap. Kode blok linear atau lebih sering disebut kode linear atas suatu lapangan hingga merupakan himpunan kode-kode blok dengan ...
Juli Loisiana Butar-Butar +1 more
doaj +1 more source
Counting Quiver Representations over Finite Fields Via Graph Enumeration [PDF]
Let $\Gamma$ be a quiver on $n$ vertices $v_1, v_2, \ldots , v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\boldsymbol{\alpha} \in \mathbb{N}^n$.
Geir Helleloid +1 more
doaj +1 more source
A theorem about linear rank inequalities that depend on the characteristic of the finite field
A linear rank inequality is a linear inequality that holds by dimensions of vector spaces over any finite field. A characteristic-dependent linear rank inequality is also a linear inequality that involves dimensions of vector spaces but this holds over ...
Victor Peña-Macias
doaj +1 more source
Supercurrent diode effect and finite-momentum superconductors [PDF]
Significance Our work shows a fascinating application of finite-momentum superconductivity, the supercurrent diode effect, which is being reported in a growing number of experiments.
N. Yuan, L. Fu
semanticscholar +1 more source
Finite field formalism for bulk electrolyte solutions [PDF]
The manner in which electrolyte solutions respond to electric fields is crucial to understanding the behavior of these systems both at, and away from, equilibrium.
S. Cox, M. Sprik
semanticscholar +1 more source
Primitive values of quadratic polynomials in a finite field [PDF]
We prove that for all $q>211$, there always exists a primitive root $g$ in the finite field $\mathbb{F}_{q}$ such that $Q(g)$ is also a primitive root, where $Q(x)= ax^2 + bx + c$ is a quadratic polynomial with $a, b, c\in \mathbb{F}_{q}$ such that $b^{2}
A. Booker +3 more
semanticscholar +1 more source
The number of rational points of certain quartic diagonal hypersurfaces over finite fields
Let $p$ be an odd prime and let $\mathbb{F}_q$ be a finite field of characteristic $p$ with order $q=p^s$. For $f(x_1, \cdots, x_n)\in\mathbb{F}_q[x_1, ..., x_n]$, we denote by $N(f(x_1, \cdots, x_n)=0)$ the number of $\mathbb{F}_q$-rational points on ...
Junyong Zhao, Shaofang Hong, Chaoxi Zhu
doaj +1 more source
Linear complexity is an important criterion to characterize the unpredictability of pseudo-random sequences, and large linear complexity corresponds to high cryptographic strength.
Jiang Ma +3 more
doaj +1 more source
ISA Extensions for Finite Field Arithmetic - Accelerating Kyber and NewHope on RISC-V
We present and evaluate a custom extension to the RISC-V instruction set for finite field arithmetic. The result serves as a very compact approach to software-hardware co-design of PQC implementations in the context of small embedded processors such as ...
E. Alkım +4 more
semanticscholar +1 more source
Elements of high order in finite fields specified by binomials
Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to explicitly construct ...
V. Bovdi, A. Diene, R. Popovych
doaj +1 more source

