Non Phelps codes of length 15 and rank 14. - Olof Heden; Thomas Westerbäck (Australas. J Comb., 2007)

Maximal partial packings of Z2n with perfect codes. - Thomas Westerbäck (Des. Codes Cryptogr., 2007)

On the existence of extended perfect binary codes with trivial symmetry group. - Olof Heden; Fabio Pasticci; Thomas Westerbäck (Adv. Math. Commun., 2009)

On rank and kernel of some mixed perfect codes. - Fabio Pasticci; Thomas Westerbäck (Discret. Math., 2009)

On the classification of perfect codes: Extended side class structures. - Olof Heden; Martin Hessler; Thomas Westerbäck (Discret. Math., 2010)

On the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2. - Olof Heden; Fabio Pasticci; Thomas Westerbäck (Adv. Math. Commun., 2012)

Almost affine locally repairable codes and matroid theory. - Thomas Westerbäck; Toni Ernvall; Camilla Hollanti (ITW, 2014)

Constructions of optimal and almost optimal locally repairable codes. - Toni Ernvall; Thomas Westerbäck; Camilla Hollanti (VITAE, 2014)

Linear Locally Repairable Codes with Random Matrices. - Toni Ernvall; Thomas Westerbäck; Camilla Hollanti (CoRR, 2014)

Applications of polymatroid theory to distributed storage systems. - Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (Allerton, 2015)

Demi-matroids from codes over finite Frobenius rings. - Thomas Britz; Keisuke Shiromoto; Thomas Westerbäck (Des. Codes Cryptogr., 2015)

A connection between locally repairable codes and exact regenerating codes. - Toni Ernvall; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (ISIT, 2016)

Bounds on the maximal minimum distance of linear locally repairable codes. - Antti Pöllänen; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (ISIT, 2016)

Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets. - Petteri Kaski; Jukka Kohonen; Thomas Westerbäck (Electron. J. Comb., 2016)

Improved Singleton-type Bounds for Locally Repairable Codes. - Antti Pöllänen; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (CoRR, 2016)

Constructions and Properties of Linear Locally Repairable Codes. - Toni Ernvall; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (IEEE Trans. Inf. Theory, 2016)

On the Combinatorics of Locally Repairable Codes via Matroid Theory. - Thomas Westerbäck; Ragnar Freij-Hollanti; Toni Ernvall; Camilla Hollanti (IEEE Trans. Inf. Theory, 2016)

On Binary Matroid Minors and Applications to Data Storage over Small Fields. - Matthias Grezet; Ragnar Freij-Hollanti; Thomas Westerbäck; Camilla Hollanti (ICMCTA, 2017)

Parity check systems of nonlinear codes over finite commutative Frobenius rings. - Thomas Westerbäck (Adv. Math. Commun., 2017)

Matroid Theory and Storage Codes: Bounds and Constructions. - Ragnar Freij-Hollanti; Camilla Hollanti; Thomas Westerbäck (CoRR, 2017)

Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures. - Matthias Grezet; Ragnar Freij-Hollanti; Thomas Westerbäck; Oktay Olmez; Camilla Hollanti (CoRR, 2017)

Uniform Minors in Maximally Recoverable Codes. - Matthias Grezet; Thomas Westerbäck; Ragnar Freij-Hollanti; Camilla Hollanti (IEEE Commun. Lett., 2019)

Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. - Matthias Grezet; Ragnar Freij-Hollanti; Thomas Westerbäck; Camilla Hollanti (IEEE Trans. Inf. Theory, 2019)

Cyclic flats of binary matroids. - Ragnar Freij-Hollanti; Matthias Grezet; Camilla Hollanti; Thomas Westerbäck (Adv. Appl. Math., 2021)