2000 character limit reached
Reed-Solomon codes over small fields with constrained generator matrices
Published 20 Aug 2018 in math.CO, cs.IT, and math.IT | (1808.06306v2)
Abstract: We give constructions of some special cases of $[n,k]$ Reed-Solomon codes over finite fields of size at least $n$ and $n+1$ whose generator matrices have constrained support. Furthermore, we consider a generalisation of the GM-MDS conjecture proposed by Lovett in 2018. We show that Lovett's conjecture is false in general and we specify when the conjecture is true.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.