Work

Splitting sums of binary polynomials

Year: 2026

Type: article

Abstract: We study an analogue of a classical arithmetic problem over the ring of polynomials.We prove that m = 5 is the minimal number such that the sums of any two distinct polynomials in a set of m polynomials over F 2 [x] cannot all be of the form x k (x + 1) ℓ .

Source: Rad Hrvatske akademije znanosti i umjetnosti Matematičke znanosti

DOI: 10.21857/y26kecdqk9

Author: Luis H. Gallardo

Institutions: Centre National de la Recherche Scientifique, Université de Bretagne Occidentale, Laboratoire de Mathématiques de Bretagne Atlantique

Language: Croatian

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W7128628498

FWCI:

Cites:

Cited by:

Related to: 10