Splitting sums of binary polynomials

DOI10.21857/Y26KECDQK9MaRDI QIDQ6855472zbMATH OpenFDO

Authors Luis Gallardo

Publication date 20 February 2026

Published in Rad Hrvatske Akademije Znanosti i Umjetnosti. Matematičke Znanosti (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21857/Y26KECDQK9

zbMATH Keywords

characteristic 2linear factorssums of polynomials

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Additive bases, including sumsets (11B13) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Cites work

• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• A polynomial variant of perfect numbers
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• On Mersenne polynomials over \(\mathbb{F}_2\)
• The sum of the divisors of a polynomial
• Unsolved problems in number theory

This page was built for publication: Splitting sums of binary polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855472)