Finite Fields
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields
Announce Type: replace Abstract: In this work, We introduce a new upper bound on the Hamming distance of simple-root constacyclic codes over finite fields, which we call the arithmetic Singleton bound. The main technical tool is the notion of a multiple equal-difference (MED) representation. Via the MED representations of the defining set of the generator polynomial of a simple-root constacyclic code, we obtain a family of upper bounds on its Hamming distance, among which the weakest one...
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
arXiv:2507.22597v2 Announce Type: replace-cross Abstract: We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to one. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre-like bound holds with equality for weighted projective spaces when the first weight is one, and when considering polynomials whose...
Construction of cyclic codes with large minimum distance from power functions over odd characteristic finite fields
Announce Type: new Abstract: Cyclic codes with dimensions exceeding half of the code length and minimum distance greater than the square root of the code length are of significant interest due to their high transmission efficiency and strong error-correcting capability. Such codes are well suited for demanding applications, including communication and storage systems, post-quantum cryptography, radar and sonar systems, wireless sensor networks, and space communications. Motivated by the work...
Full-Field Calibration of Coupled Thermomechanical Material Models at Finite Strain
arXiv:2606.05465v1 Announce Type: new Abstract: Calibrating thermomechanical material models from experiments is challenging because deformation, temperature, and force responses are strongly coupled, while measurements are usually restricted to specimen surfaces. We present a full-field calibration framework for coupled finite-strain thermomechanical material models using boundary displacement, reaction-force data, and temperature. The forward model is formulated as a near-incompressible...
Entropy-stable and energy-conservative fully-discrete finite element method for non-isothermal phase-field models
Announce Type: new Abstract: This work presents a conforming finite-element scheme for non-isothermal phase-field systems coupled to the incompressible Navier-Stokes equations. The proposed numerical scheme preserves entropy production and total energy conservation exactly by variable transformations using entropy as main variable instead of temperature.
Algebra of Bivariate-Bicycle Surface Codes
arXiv:2606.08771v1 Announce Type: cross Abstract: We relate the properties of bivariate-bicycle-surface (BBS) codes, constructed from a pair of bivariate polynomials over a finite field, to the number and location of their common roots in the extension field. The number of roots $(x,y)$ with finite, non-zero coordinates -- counted with algebraic multiplicity -- determines the dimension of the codes. This dimension is invariant under monomial automorphisms of the Laurent polynomial ring.
Exact output statistics of Icart's encoding in the exceptional \(j=0\) case
Announce Type: cross Abstract: Icart's encoding is a classical deterministic map from finite fields to elliptic curves and a basic ingredient in early hash-to-curve constructions. We determine the exact one-output distribution of this map in the exceptional \(j=0\) case. More precisely, for \[ E_{0,b}:Y^2=X^3+b,\ q\equiv2\pmod3, \] we compute the complete fibre distribution of \(f_{0,b}:\mathbb F_q\to E_{0,b}(\mathbb F_q)\).
Almost perfect nonlinear power functions with exponents expressed as fractions
arXiv:2307.15657v3 Announce Type: replace Abstract: Let $F$ be a finite field, let $f$ be a function from $F$ to $F$, and let $a$ be a nonzero element of $F$. The discrete derivative of $f$ in direction $a$ is $\Delta_a f \colon F \to F$ with $(\Delta_a f)(x)=f(x+a)-f(x)$. The differential spectrum of $f$ is the multiset of cardinalities of all the fibers of all the derivatives $\Delta_a f$ as $a$ runs through $F^*$. An almost perfect nonlinear (APN) function is one for which the largest...
Formal verification of the S-two AIR
arXiv:2606.04311v1 Announce Type: new Abstract: StarkWare's S-two prover provides an efficient means for establishing, on blockchain, that a program written in the Cairo virtual machine language runs to completion. The latter claim is encoded by an algebraic intermediate representation (AIR) that captures the semantics of the Cairo language. The AIR asserts the existence of tables of values from a finite field satisfying certain algebraic constraints.
Reed-Muller type codes over a combinatorial simplex: an algebraic description
arXiv:2606.02819v1 Announce Type: new Abstract: Given an ordered set $B$ of a finite field, a combinatorial simplex over $B$ is defined as the set of vectors such that the positions of the entries, with respect to $B$, sum up to a fixed integer. CAP codes are Reed-Muller type codes defined over a combinatorial simplex.