13 citations · 17 across the 3 of their papers we have counts for
6 papers
Cyclic Flats of Binary Matroids
Ragnar Freij-Hollanti, Matthias Grezet, Camilla Hollanti +1
In this paper, first steps are taken towards characterising lattices of cyclic flats that belong to matroids that can be represented over a prescribed finite f…
Uniform Minors in Maximally Recoverable Codes
Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti +1
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 matro…
The Complete Hierarchical Locality of the Punctured Simplex Code
Matthias Grezet, Camilla Hollanti
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by…
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck +1
Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by…
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck +2
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are ove…
On Binary Matroid Minors and Applications to Data Storage over Small Fields
Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck +1
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the cons…