Optimal selection for good polynomials of degree up to five

An (r, l)-good polynomial is a polynomial of degree r + 1 that is constant on l subsets of F-q, each of size r + 1. For any positive integer r <= 4 we provide an (r, l)-good polynomial such that l = C(r)q + O(root q), with C-r maximal. This directly provides an explicit estimate (up to an error term of O(root q), with explict constant) for the maximal length and dimension of a Tamo-Barg LRC. Moreover, we explain how to construct good polynomials achieving these bounds. Finally, we provide computational examples to show how close our estimates are to the actual values of l, and we explain how to obtain the best possible good polynomials in degree 5. Our results complete the study by Chen et al. (Des Codes Cryptogr 89(7):1639-1660, 2021), providing (r, l)-good polynomials of degree up to 5, with l maximal (up to an error term of root q), and our methods are independent.