Even expander codes can hit GV, with certified finite-length bounds, failure probabilities, and no decoding fairy dust.

Constructs explicit finite-field maps with lower affine/polynomial agreement than the Fourier bound allows.

Can you get fast large-field linear codes with just adds and tiny coefficients? This paper says mostly yes, with distance guarantees.

Can explicit vectorial functions really beat the Fourier bound, and even stay far from low-degree polynomials?

Paper on verifying supersingularity and superspeciality of abelian surfaces, with Monte Carlo and smooth-order tests, because receipts ma...

So, does this Lean repo actually prove Logjumps’ Montgomery reduction matches the spec, or just wave at it?

Preprint on affine equivalence testing for finite-field functions and self-equivalence generators, because symmetries do happen.

Subexponential algorithms for a planted isotropic space problem, then the paper turns around and uses it for secret sharing.

New algebraic attacks now break some UOV, MAYO, SNOVA, and QR-UOV sets that older methods left alone.

Hamming ideals meet Gröbner bases for syndrome decoding, because apparently codewords also need commutative algebra.