Counting generalized Reed-Solomon codes
Information Theory
2016-11-15 v1 Discrete Mathematics
math.IT
Abstract
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.
Cite
@article{arxiv.1611.04341,
title = {Counting generalized Reed-Solomon codes},
author = {Peter Beelen and David Glynn and Tom Høholdt and Krishna Kaipa},
journal= {arXiv preprint arXiv:1611.04341},
year = {2016}
}