2018/08/20 by Greaves, Gary, Syatriadi, Jeven
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1808.06306
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.