Counting generalized Reed-Solomon codes
  In this article we count the number of generalized Reed-Solomon (GRS) codes of dimension k and length n, including the codes coming from a non-degenerate conic plus nucleus. We compare our results with known formulae for the number of 3-dimensional MDS codes of length n=6,7,8,9. 
Peter Beelen, David Glynn, Tom H{\o}holdt, and Krishna Kaipa
cs.IT cs.DM math.IT