A proof of the GM-MDS conjecture

03/07/2018
by   Shachar Lovett, et al.
0

The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS condition, which guarantees the existence of MDS matrices with a prescribed set of zeros over large fields, is in fact sufficient for existence of such matrices over small fields. We prove this conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
11/16/2021

On The Number of Different Entries in Involutory MDS Matrices over Finite Fields of Characteristic Two

Two of many criteria of a good MDS matrix are being involutory and havin...
research
11/21/2016

Enforcing Relational Matching Dependencies with Datalog for Entity Resolution

Entity resolution (ER) is about identifying and merging records in a dat...
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...
research
01/07/2020

Rainbow matchings in k-partite hypergraphs

In this paper, we prove a conjecture of Aharoni and Howard on the existe...
research
06/28/2023

A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams

Ferrers diagram rank-metric codes were introduced by Etzion and Silberst...

Please sign up or login with your details

Forgot password? Click here to reset