惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Martin Fowler
Martin Fowler
Blog — PlanetScale
Blog — PlanetScale
Vercel News
Vercel News
L
LangChain Blog
Google DeepMind News
Google DeepMind News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
F
Fortinet All Blogs
The GitHub Blog
The GitHub Blog
Recent Announcements
Recent Announcements
D
DataBreaches.Net
云风的 BLOG
云风的 BLOG
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
A
About on SuperTechFans
博客园_首页
N
Netflix TechBlog - Medium
Y
Y Combinator Blog
Hugging Face - Blog
Hugging Face - Blog
Last Week in AI
Last Week in AI
酷 壳 – CoolShell
酷 壳 – CoolShell
B
Blog
Apple Machine Learning Research
Apple Machine Learning Research
罗磊的独立博客
美团技术团队
V
V2EX

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Differential Goppa Codes
David González González, Ángel Luis Muñoz Castañeda, Luis Manuel · 2026-03-04 · via cs.IT updates on arXiv.org

Rosenbloom and Tsfasman, in their foundational work on the $m$-metric, introduced algebraic-geometric codes defined by multiple points on a smooth projective curve $X$. This construction involves a divisor $G$ and another divisor $D=\sum n p_i$, where $p_i$ are distinct rational points with $p_i \notin \text{supp}(G)$ and $n\in\mathbb{N}$. Although these codes are significant, their formal development for arbitrary genus remains incomplete in the literature, as most studies have concentrated on the genus $0$ case. We present a rigorous treatment of this class of codes. Starting with a smooth projective curve $X$, an invertible sheaf $L$, and an effective divisor $D=\sum n_i p_i$ where the $n_i$ are not necessarily equal, as well as tuples of uniformizers $t_D$ at the points of $D$ and trivializations $γ_D$ for the localizations $L_{p_i}$, the associated differential Goppa code is defined. This code arises from the theory of $n$-jets of invertible sheaves on curves, which enables the description of codewords using Hasse-Schmidt derivatives of sections of $L$. The variation of the code under changes in the data $(t_D, γ_D)$ is examined, and the group acting on these parameters is described. The behavior of the minimum Hamming distance under such variations is analyzed, with explicit examples provided for curves of genus $0$ and $1$. A duality theorem is established, involving principal parts of meromorphic differential forms. It is demonstrated that Goppa codes constitute a proper subclass of differential Goppa codes, and that every linear code admits a differential Goppa code structure on $\mathbb P^1$ using only two rational points.