Uniform Minors in Maximally Recoverable Codes

06/06/2019
by   Matthias Grezet, et al.
0

In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matroid theory and the relation between MDS codes and uniform minors, the list of all the possible uniform minors is derived. This list is used to improve the known non-asymptotic lower bound on the required field size of a maximally recoverable code.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2021

Higher-Order MDS Codes

An improved Singleton-type upper bound is presented for the list decodin...
research
12/21/2022

Improved Field Size Bounds for Higher Order MDS Codes

Higher order MDS codes are an interesting generalization of MDS codes re...
research
11/27/2020

A Construction of Maximally Recoverable Codes with Order-Optimal Field Size

We construct maximally recoverable codes (corresponding to partial MDS c...
research
06/10/2022

Generic Reed-Solomon codes achieve list-decoding capacity

In a recent paper, Brakensiek, Gopi and Makam introduced higher order MD...
research
05/09/2023

On the Structure of Higher Order MDS Codes

A code of length n is said to be (combinatorially) (ρ,L)-list decodable ...
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
05/14/2020

Minimizing the alphabet size of erasure codes with restricted decoding sets

A Maximum Distance Separable code over an alphabet F is defined via an e...

Please sign up or login with your details

Forgot password? Click here to reset