arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2301.03569math.NTcs.ITmath.AGmath.IT
收藏

代码和模曲线

Codes and modular curves

Alain Couvreur

摘要:

这些课堂讲稿是为苏黎世大学2022年暑期班的代数编码理论(ACT)课程编写的。本课程的目标是深入介绍编码理论中最引人注目的结果之一的证明:Tsfasman Vllidadu Zink定理,该定理断言对于某些素数幂$q$,存在$\mathbb{F}_q$上的码序列,其渐近参数击败随机码。

英文摘要:

These lecture notes have been written for a course at the Algebraic Coding Theory (ACT) summer school 2022 that took place in the university of Zurich. The objective of the course propose an in-depth presentation of the proof of one of the most striking results of coding theory: Tsfasman Vlăduţ Zink Theorem, which asserts that for some prime power $q$, there exist sequences of codes over $\mathbb{F}_q$ whose asymptotic parameters beat random codes.

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

↑