Open Source
Asymptotically good codes from Siegel modular varieties
arXiv math.IT0 views
arXiv:2611.14125v1 Announce Type: cross Abstract: We construct asymptotically good codes by evaluating Siegel modular forms at superspecial points on congruence towers of Siegel modular varieties. For every genus $g\ge2$ and every fixed weight $w\ge g+1$, the construction gives such a family in sufficiently large characteristic, over a finite field which is independent of the level of the tower. The towers can be chosen so that this field is $\mathbb{F}_{p^2}$. We give an explicit lower bound for the asymptotic rate. The lower bound for the relative minimum distance follows from the Pieri formula on the space of flags in the Hodge bundle and an intersection argument along its strata. We also prove that, for $p\ge5$ and $0\le w\le p+1$, the kernel of evaluation in every genus consists precisely of the multiples of the ordinary Hasse invariant. For $g=2,3$, the geometry of the supersingular locus gives explicit bounds for the relative minimum distance and recovery sets whose sizes are bounded independently of the level.
Source:https://arxiv.org/abs/2611.14125PreviousThermodynamic Formalism for Non-Invariant Probabilities: Entropy, Divergence, ChannelsNextExplicit restricted isometries with $k=m^{2/3-o(1)}$
Related posts

Reverse Engineering Tools: A Free Starter Kit for Your First Binary
0dev.to
Software Refactoring Research with Large Language Models: A Systematic Literature Review
0arXiv cs.SE
Antalia-2 Mini: A 7.6-million-parameter Turkish text-to-speech model trained entirely on synthetic speech
0arXiv cs.SD
Emilia2: A Large-Scale Dataset for Controllable Long-Form Speech Generation
0arXiv cs.SD
On the Concavity of R\'enyi Entropy and R\'enyi Entropy Power along Heat Flows on Manifolds
0arXiv math.IT
Multimodal Judges Flag, Humans Decide: A Review-and-Edit Framework for AI-Generated Product Video Ads
0arXiv cs.HC