activity
20162026
most citedAlphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes

13 citations · 16 across the 3 of their papers we have counts for

collaborators

5 papers

math.AC2026

Constructing Koszul filtrations: existence and non-existence for G-quadratic algebras

Emily Berghofer, Lisa Nicklasson, Peder Thompson +1

Given a standard graded algebra over a field, we consider the relationship between G-quadraticity and the existence of a Koszul filtration. We show that having a quadratic Gröbner…

math.CO2019

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…

cs.IT2019★ 3 cited

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…

cs.IT2018★ 13 cited

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…

cs.IT2016

Parity check systems of nonlinear codes over finite commutative Frobenius rings

Thomas Westerbäck

The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this co…