3 citations · 3 across the 1 of their papers we have counts for
3 papers
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.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…