Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes

This paper focuses on incidences over finite fields, extending to higher degrees a result by Vinh [1] on the number of point-line incidences in the plane F2, where F is a finite field. Specifically, we present a bound on the number of incidences between points and polynomials of bounded degree in F2. Our approach employs a singular value decomposition of the incidence matrix between points and polynomials, coupled with an analysis of the related group algebras. This bound is then applied to coding theory, specifically to the problem of average-radius list decoding of Reed-Solomon (RS) codes. We demonstrate that RS codes of certain lengths are average-radius list-decodable with a constant list size, which is dependent on the code rate and the distance from the Johnson radius. While a constant list size for list-decoding of RS codes in this regime was previously established, its existence for the stronger notion of average-radius list-decoding was not known to exist.