  Locally recoverable codes are widely used in distributed and cloud storage
systems. The objective of this paper is to present a construction of near MDS
codes with oval polynomials and then determine the locality of the codes. It
turns out that the near MDS codes and their duals are both distance-optimal and
dimension-optimal locally recoverable codes. The lengths of the locally
recoverable codes are different from known ones in the literature.
