arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.01162cs.ITmath.IT
收藏

分布式矩阵乘法友好的代数函数域

Distributed Matrix Multiplication-Friendly Algebraic Function Fields

Sun Yat-sen University(中山大学);Guangdong Key Laboratory of Information Security Technology(广东省信息安全技术重点实验室)

Yun Long Zhu, Chang-An Zhao

AI总结:

本文提出适用于多项式码和Matdot码的分布式矩阵乘法(DMM)友好代数函数域及其构造,为多项式AG码和Matdot AG码建立最优恢复阈值,在特定参数下提供超过基础有限域大小的有理位,为矩阵乘法实现带来实际改进。

摘要:

本文引入了适用于多项式码和Matdot码的分布式矩阵乘法(DMM)友好的代数函数域,并通过有理函数域的扩展提出了此类函数域的若干构造。将多项式码和Matdot码扩展到代数函数域的主要挑战在于构造最优解码方案。我们为固定矩阵乘法的多项式代数几何(AG)码和Matdot AG码建立了最优恢复阈值。我们提出的函数域支持具有最优恢复阈值的DMM,同时在特定参数范围内提供超过基础有限域大小的有理位。尽管这些域可能无法实现最优计算效率,但我们的结果为矩阵乘法实现提供了实际改进。文中给出了适用函数域的显式示例。

英文摘要:

In this paper, we introduce distributed matrix multiplication (DMM)-friendly algebraic function fields for polynomial codes and Matdot codes, and present several constructions for such function fields through extensions of the rational function field. The primary challenge in extending polynomial codes and Matdot codes to algebraic function fields lies in constructing optimal decoding schemes. We establish optimal recovery thresholds for both polynomial algebraic geometry (AG) codes and Matdot AG codes for fixed matrix multiplication. Our proposed function fields support DMM with optimal recovery thresholds, while offering rational places that exceed the base finite field size in specific parameter regimes. Although these fields may not achieve optimal computational efficiency, our results provide practical improvements for matrix multiplication implementations. Explicit examples of applicable function fields are provided.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑