Support Constrained Generator Matrices and the Generalized Hamming Weights

07/15/2021
by   Hao Chen, et al.
0

Support constrained generator matrices for linear codes have been found applications in multiple access networks and weakly secure document exchange. The necessary and sufficient conditions for the existence of Reed-Solomon codes with support constrained generator matrices were conjectured by Dau, Song, Yuen and Hassibi. This conjecture is called the GM-MDS conjecture and finally proved recently in independent works of Lovett and Yildiz-Hassibi. From their conjecture support constrained generator matrices for MDS codes are existent over linear size small fields. In this paper we propose a natural generalized conjecture for the support constrained matrices based on the generalized Hamming weights (SCGM-GHW conjecture). The GM-MDS conjecture can be thought as a very special case of our SCGM-GHW conjecture for linear 1-MDS codes. We investigate the support constrained generator matrices for some linear codes such as 2-MDS codes, first order Reed-Muller codes, algebraic-geometric codes from elliptic curves from the view of our SCGM-GHW conjecture. In particular the direct generalization of the GM-MDS conjecture about 1-MDS codes to 2-MDS codes is not true. For linear 2-MDS codes only cardinality-based constraints on subset systems are not sufficient for the purpose that these subsets are in the zero coordinate position sets of rows in generator matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/20/2018

Reed-Solomon codes over small fields with constrained generator matrices

We give constructive proofs of the existence of [n,k] Reed-Solomon codes...
research
03/30/2021

Generalized b-weights and b-MDS Codes

In this paper, we first introduce the notion of generalized b-weights of...
research
03/22/2019

Gabidulin Codes with Support Constrained Generator Matrices

Gabidulin codes are the only known general construction of linear codes ...
research
01/24/2018

Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes

Designing good error correcting codes whose generator matrix has a suppo...
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
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
12/11/2020

On additive MDS codes over small fields

Let C be a (n,q^2k,n-k+1)_q^2 additive MDS code which is linear over 𝔽_q...

Please sign up or login with your details

Forgot password? Click here to reset