Abstract: In recent literature, a family of optimal linear locally recoverable codes (LRC codes) that attain the maximum possible distance (given code length, cardinality, and locality) is presented.
Abstract: We introduce sparse polynomial zonotopes, a new set representation for formal verification of hybrid systems. Sparse polynomial zonotopes can represent nonconvex sets and are generalizations ...
This is inspired by Kolmogorov-Arnold Networks https://arxiv.org/abs/2404.19756v2, which uses B-splines to approximate functions. B-splines are poor in performance ...
This repository contains a pure python implementation of CRYSTALS-Dilithium following (at the time of writing) the most recent specification (v3.1) This project has followed kyber-py which is a ...
Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H̃μ. We give a combinatorial proof of this conjecture, which establishes the existence and integrality of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results