Uniform Minors in Maximally Recoverable Codes

Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti

Research output: Contribution to journalArticleScientificpeer-review


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.
Original languageEnglish
Pages (from-to)1297-1300
JournalIEEE Communications Letters
Issue number8
Publication statusPublished - 7 Jun 2019
MoE publication typeA1 Journal article-refereed


  • distributed storage
  • locally repairable codes
  • maximally recoverable codes
  • uniform minors
  • field size

Fingerprint Dive into the research topics of 'Uniform Minors in Maximally Recoverable Codes'. Together they form a unique fingerprint.

Cite this