May 15, 2024, 4:11 a.m. | Maximilien Gadouleau, Luca Mariot, Federico Mazzone

cs.CR updates on arXiv.org arxiv.org

arXiv:2405.08741v1 Announce Type: cross
Abstract: We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$. The motivation for this problem lies in a recent construction for subspace codes based on cellular automata. More precisely, the minimum distance of such subspace codes relates to the maximum degree $d$ of …

arxiv binary construction cs.cr cs.dm families linear math.co motivation

Sr. Product Manager

@ MixMode | Remote, US

Information Security Engineers

@ D. E. Shaw Research | New York City

Endpoint Security Engineer

@ Sabre Corporation | GBR LNDN 25 Walbrook FL5&6

Consultant - System Management

@ LTIMindtree | Bellevue - Washington - USA, WA, US

Security Compliance Officer - ESO

@ National Grid | Wokingham, GB, RG41 5BN

Information Security Specialist (Governance and Compliance)

@ Co-operators | Ontario, Canada; Saskatchewan, Canada; Alberta, Canada