Algebraic Geometry Codes and Huawei's 8th Problem
Speaker：Chuangqiang Hu
Schedule：Every Friday, 2021.09.17 ~ 12.03, 15:20 ~ 16:55
Venue: BIMSA RM 1118
Zoom ID：638 227 8222, Password:BIMSA
Description:
Since Goppa constructed algebraic geometric(AG) codes from several rational places, the study of AG codes becomes an important instrument in coding theory. For a given AG code, the famous Riemann–Roch theorem gives a non-trivial lower bound, named Goppa bound, for the minimum distance in a very general setting. I will present a brief introduction to AG Codes and explain in detail its relation to Huawei’s 8th problem.
Prerequisite：
Basic knowledge of Number Theory and Algebraic Geometry
References：
Algebraic Function Fields and Codes
Videos:
[1](PW: 8xN$s8D$) [2](PW: 3Y#4=!Bh) [3](PW: s&u8+AF3) [4](PW: 4aQDU%5q) [5](PW: 8+@ZMB1^) [6](PW: x03?e@N&) [7](PW: At6*&QB4) [8](PW: F3Sz#BX8) [9](PW: 2pMCKxX%)
Notes:
