Prefer a chat interface with context about you and your work?
Optimum Linear Codes with Support Constraints over Small Fields
We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size and with the …