Thomas Westerbäck

Adv. Appl. Math., 2021

2019

Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Uniform Minors in Maximally Recoverable Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2019

2017

Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures.

[BibT_eX]

[DOI]

Oktay Olmez

CoRR, 2017

Matroid Theory and Storage Codes: Bounds and Constructions.

[BibT_eX]

[DOI]

CoRR, 2017

Parity check systems of nonlinear codes over finite commutative Frobenius rings.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2017

On Binary Matroid Minors and Applications to Data Storage over Small Fields.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016

On the Combinatorics of Locally Repairable Codes via Matroid Theory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Constructions and Properties of Linear Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Improved Singleton-type Bounds for Locally Repairable Codes.

[BibT_eX]

[DOI]

Antti Pöllänen

CoRR, 2016

Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets.

[BibT_eX]

[DOI]

Petteri Kaski

Jukka Kohonen

Electron. J. Comb., 2016

Bounds on the maximal minimum distance of linear locally repairable codes.

[BibT_eX]

[DOI]

Antti Pöllänen

Proceedings of the IEEE International Symposium on Information Theory, 2016

A connection between locally repairable codes and exact regenerating codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Demi-matroids from codes over finite Frobenius rings.

[BibT_eX]

[DOI]

Thomas Britz

Keisuke Shiromoto

Des. Codes Cryptogr., 2015

Applications of polymatroid theory to distributed storage systems.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014

Linear Locally Repairable Codes with Random Matrices.

[BibT_eX]

[DOI]

CoRR, 2014

Constructions of optimal and almost optimal locally repairable codes.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Wireless Communications, 2014

Almost affine locally repairable codes and matroid theory.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

2012

On the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2.

[BibT_eX]

[DOI]

Fabio Pasticci

Adv. Math. Commun., 2012

2010

On the classification of perfect codes: Extended side class structures.

[BibT_eX]

[DOI]

Martin Hessler

Discret. Math., 2010

2009

On rank and kernel of some mixed perfect codes.

[BibT_eX]

[DOI]

Fabio Pasticci

Discret. Math., 2009

On the existence of extended perfect binary codes with trivial symmetry group.

[BibT_eX]

[DOI]

Fabio Pasticci

Adv. Math. Commun., 2009

2007

Maximal partial packings of Z2n with perfect codes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2007

Non Phelps codes of length 15 and rank 14.

[BibT_eX]

[DOI]