Reed-Solomon codes over small fields with constrained generator matrices

08/20/2018
by   Gary Greaves, et al.
0

We give constructive proofs of the existence 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2021

Support Constrained Generator Matrices and the Generalized Hamming Weights

Support constrained generator matrices for linear codes have been found ...
research
03/07/2018

A proof of the GM-MDS conjecture

The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS ...
research
12/15/2022

Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix

Linearized Reed-Solomon (LRS) codes are a class of evaluation codes base...
research
03/10/2018

Optimum Linear Codes with Support Constraints over Small Fields

We consider the problem of designing optimal linear codes (in terms of h...
research
09/12/2022

Rook Theory of the Etzion-Silberstein Conjecture

In 2009, Etzion and Siberstein proposed a conjecture on the largest dime...
research
03/07/2018

MDS matrices over small fields: A proof of the GM-MDS conjecture

An MDS matrix is a matrix whose minors all have full rank. A question ar...
research
10/04/2018

On (weak) fpc generators

Corrado Böhm once observed that if Y is any fixed point combinator (fpc)...

Please sign up or login with your details

Forgot password? Click here to reset