The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum es...The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, we show that the error distance can be determined precisely when the degree of the received word is small. As an application of our method, we give a significant improvement of the recent bound of Cheng-Murray on non-existence of deep holes (words with maximal error distance).展开更多
This is an expository paper on algebraic aspects of exponential sums over finite fields.This is a new direction.Various examples,results and open problems are presented along the way,with particular emphasis on Gauss ...This is an expository paper on algebraic aspects of exponential sums over finite fields.This is a new direction.Various examples,results and open problems are presented along the way,with particular emphasis on Gauss periods,Kloosterman sums and one variable exponential sums.One main tool is the applications of various p-adic methods.For this reason,the author has also included a brief exposition of certain p-adic estimates of exponential sums.The material is based on the lectures given at the 2020 online number theory summer school held at Xiamen University.Notes were taken by Shaoshi Chen and Ruichen Xu.展开更多
文摘The complexity of decoding the standard Reed-Solomon code is a well known open prob-lem in coding theory. The main problem is to compute the error distance of a received word. Using the Weil bound for character sum estimate, we show that the error distance can be determined precisely when the degree of the received word is small. As an application of our method, we give a significant improvement of the recent bound of Cheng-Murray on non-existence of deep holes (words with maximal error distance).
基金partially supported by the National Natural Science of Foundation under Grant No.1900929。
文摘This is an expository paper on algebraic aspects of exponential sums over finite fields.This is a new direction.Various examples,results and open problems are presented along the way,with particular emphasis on Gauss periods,Kloosterman sums and one variable exponential sums.One main tool is the applications of various p-adic methods.For this reason,the author has also included a brief exposition of certain p-adic estimates of exponential sums.The material is based on the lectures given at the 2020 online number theory summer school held at Xiamen University.Notes were taken by Shaoshi Chen and Ruichen Xu.
