Thomas Westerbäck

According to our database1, Thomas Westerbäck authored at least 23 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes.
IEEE Trans. Inf. Theory, 2019

Uniform Minors in Maximally Recoverable Codes.
IEEE Commun. Lett., 2019

2017
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures.
CoRR, 2017

Matroid Theory and Storage Codes: Bounds and Constructions.
CoRR, 2017

Parity check systems of nonlinear codes over finite commutative Frobenius rings.
Adv. Math. Commun., 2017

On Binary Matroid Minors and Applications to Data Storage over Small Fields.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
On the Combinatorics of Locally Repairable Codes via Matroid Theory.
IEEE Trans. Inf. Theory, 2016

Constructions and Properties of Linear Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2016

Improved Singleton-type Bounds for Locally Repairable Codes.
CoRR, 2016

Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets.
Electron. J. Comb., 2016

Bounds on the maximal minimum distance of linear locally repairable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

A connection between locally repairable codes and exact regenerating codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Demi-matroids from codes over finite Frobenius rings.
Des. Codes Cryptogr., 2015

Applications of polymatroid theory to distributed storage systems.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Linear Locally Repairable Codes with Random Matrices.
CoRR, 2014

Constructions of optimal and almost optimal locally repairable codes.
Proceedings of the 4th International Conference on Wireless Communications, 2014

Almost affine locally repairable codes and matroid theory.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

2012
On the symmetry group of extended perfect binary codes of length <i>n+1</i> and rank <i>n-log(n+1)+2</i>.
Adv. Math. Commun., 2012

2010
On the classification of perfect codes: Extended side class structures.
Discret. Math., 2010

2009
On rank and kernel of some mixed perfect codes.
Discret. Math., 2009

On the existence of extended perfect binary codes with trivial symmetry group.
Adv. Math. Commun., 2009

2007
Maximal partial packings of <i>Z</i><sub>2</sub><sup><i>n</i></sup> with perfect codes.
Des. Codes Cryptogr., 2007

Non Phelps codes of length 15 and rank 14.
Australas. J Comb., 2007


  Loading...