| On the combinatorics of locally repairable codes via matroid theory T Westerbäck, R Freij-Hollanti, T Ernvall, C Hollanti IEEE Transactions on Information Theory 62 (10), 5296-5315, 2016 | 45 | 2016 |
| Constructions and properties of linear locally repairable codes T Ernvall, T Westerbäck, R Freij-Hollanti, C Hollanti IEEE Transactions on Information Theory 62 (3), 1129-1143, 2015 | 38 | 2015 |
| Constructions of optimal and almost optimal locally repairable codes T Ernvall, T Westerbäck, C Hollanti 2014 4th International Conference on Wireless Communications, Vehicular …, 2014 | 20 | 2014 |
| Almost affine locally repairable codes and matroid theory T Westerbäck, T Ernvall, C Hollanti 2014 IEEE Information Theory Workshop (ITW 2014), 621-625, 2014 | 14 | 2014 |
| Applications of polymatroid theory to distributed storage systems T Westerbäck, R Freij-Hollanti, C Hollanti 2015 53rd Annual Allerton Conference on Communication, Control, and …, 2015 | 13 | 2015 |
| On the existence of extended perfect binary codes with trivial symmetry group O Heden, F Pasticci, T Westerbäck Advances in Mathematics of Communications 3 (3), 295-309, 2009 | 13 | 2009 |
| Fast M\" obius inversion in semimodular lattices and U-labelable posets P Kaski, J Kohonen, T Westerbäck arXiv preprint arXiv:1603.03889, 2016 | 12 | 2016 |
| Alphabet-dependent bounds for linear locally repairable codes based on residual codes M Grezet, R Freij-Hollanti, T Westerbäck, C Hollanti IEEE Transactions on Information Theory 65 (10), 6089-6100, 2019 | 11 | 2019 |
| Matroid theory and storage codes: bounds and constructions R Freij-Hollanti, C Hollanti, T Westerbäck Network Coding and Subspace Designs, 385-425, 2018 | 10 | 2018 |
| Cyclic flats of binary matroids R Freij-Hollanti, M Grezet, C Hollanti, T Westerbäck Advances in Applied Mathematics 127, 102165, 2021 | 9 | 2021 |
| Locally repairable codes with availability and hierarchy: matroid theory via examples R Freij-Hollanti, T Westerbäck, C Hollanti International Zurich Seminar on Communications-Proceedings, 45-49, 2016 | 9 | 2016 |
| Demi-matroids from codes over finite Frobenius rings T Britz, K Shiromoto, T Westerbäck Designs, Codes and Cryptography 75, 97-107, 2015 | 8 | 2015 |
| A connection between locally repairable codes and exact regenerating codes T Ernvall, T Westerbäck, R Freij-Hollanti, C Hollanti 2016 IEEE International Symposium on Information Theory (ISIT), 650-654, 2016 | 7 | 2016 |
| Linear locally repairable codes with random matrices T Ernvall, T Westerbäck, C Hollanti arXiv preprint arXiv:1408.0180, 2014 | 6 | 2014 |
| On the polymatroidal structure of quasi-uniform codes with applications to heterogeneous distributed storage T Westerbäck, M Grezet, R Freij-Hollanti, C Hollanti International Symposium on Mathematical Theory of Networks and Systems, 641-647, 2018 | 5 | 2018 |
| Bounds on the maximal minimum distance of linear locally repairable codes A Pöllänen, T Westerbäck, R Freij-Hollanti, C Hollanti 2016 IEEE International Symposium on Information Theory (ISIT), 1586-1590, 2016 | 5 | 2016 |
| Uniform minors in maximally recoverable codes M Grezet, T Westerbäck, R Freij-Hollanti, C Hollanti IEEE Communications Letters 23 (8), 1297-1300, 2019 | 4 | 2019 |
| On binary matroid minors and applications to data storage over small fields M Grezet, R Freij-Hollanti, T Westerbäck, C Hollanti International Castle Meeting on Coding Theory and Applications, 139-153, 2017 | 3 | 2017 |
| Bounds on binary locally repairable codes tolerating multiple erasures M Grezet, R Freij-Hollanti, T Westerbäck, O Olmez, C Hollanti arXiv preprint arXiv:1709.05801, 2017 | 2 | 2017 |
| Parity check systems of nonlinear codes over finite commutative Frobenius rings T Westerbäck arXiv preprint arXiv:1604.06996, 2016 | 2 | 2016 |
