Publications for the following people: Thomas Westerbäck
2021 | 2019 | 2018 | 2017 | 2016 | 2014
Freij-Hollanti, Ragnar, Grezet, Matthias, Hollanti, Camilla, Westerbäck, Thomas: Cyclic flats of binary matroids, ADVANCES IN APPLIED MATHEMATICS. 127, 2021. [BibTeX...]
Grezet, Matthias, Westerbäck, Thomas, Freij-Hollanti, Ragnar, Hollanti, Camilla: Uniform Minors in Maximally Recoverable Codes, IEEE COMMUNICATIONS LETTERS. 23(8), 2019, p. 1297-1300. [BibTeX...]
Grezet, Matthias, Freij-Hollanti, Ragnar, Westerbäck, Thomas, Hollanti, Camilla: Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes, IEEE Transactions on information theory. 65(10), 2019, p. 6089-6100. [BibTeX...]
Grezet, Matthias, Freij-Hollanti, Ragnar , Westerbäck, Thomas, Olmez, Oktay, Hollanti, Camilla: Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures, The International Zurich Seminar on Information and Communication (IZS 2018) Proceedings., p. 103-107. [BibTeX...]
Freij-Hollanti, Ragnar, Hollanti, Camilla, Westerbäck, Thomas: Matroid Theory and Storage Codes : Bounds and Constructions, Signals and Communication Technology., 2018, p. 385-425. [BibTeX...]
Westerbäck, Thomas: Parity check systems of nonlinear codes over finite commutative frobenius rings, ADVANCES IN MATHEMATICS OF COMMUNICATIONS. 11(3), 2017, p. 409-427. [BibTeX...]
Grezet, Matthias, Freij-Hollanti, Ragnar, Westerbäck, Thomas, Hollanti, Camilla: On binary matroid minors and applications to data storage over small fields, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 10495 LNCS, 2017, p. 139-153. [BibTeX...]
Kaski, Petteri, Kohonen, Jukka, Westerbäck, Thomas: Fast möbius inversion in semimodular lattices and ER-labelable posets, Electronic Journal of Combinatorics. 23(3), 2016, p. 1-13. [BibTeX...]
Pöllänen, Antti, Westerbäck, Thomas, Freij-Hollanti, Ragnar, Hollanti, Camilla: Bounds on the maximal minimum distance of linear locally repairable codes, IEEE International Symposium on Information Theory. 2016-August, 2016, p. 1586-1590. [BibTeX...]
Ernvall, Toni, Westerbäck, Thomas, Freij-Hollanti, Ragnar, Hollanti, Camilla: A connection between locally repairable codes and exact regenerating codes, IEEE International Symposium on Information Theory. 2016-August, 2016, p. 650-654. [BibTeX...]
Westerbäck, Thomas, Freij-Hollanti, Ragnar, Hollanti, Camilla: Applications of polymatroid theory to distributed storage systems, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015., p. 231-237. [BibTeX...]
Ernvall, Toni, Westerbäck, Thomas, Freij-Hollanti, Ragnar, Hollanti, Camilla: Constructions and Properties of Linear Locally Repairable Codes, IEEE Transactions on information theory. 62(3), 2016, p. 1129-1143. [BibTeX...]
Westerbäck, Thomas, Freij-Hollanti, Ragnar, Ernvall, Toni, Hollanti, Camilla: On the Combinatorics of Locally Repairable Codes via Matroid Theory, IEEE Transactions on information theory. 62(10), 2016, p. 5296-5315. [BibTeX...]
Freij-Hollanti, Ragnar, Westerbäck, Thomas, Hollanti, Camilla: Locally repairable codes with availability and hierarchy: matroid theory via examples, International Zurich Seminar on Communications (ETH/IEEE), Zurich, March 2016., p. 45-49. [BibTeX...]
Westerbäck, Thomas, Ernvall, Toni, Hollanti, Camilla: Almost affine locally repairable codes and matroid theory, 2014 IEEE Inform. Theory Workshop (ITW). Hobart, Tasmania. Nov. 2014.. [BibTeX...]
Ernvall, Toni, Westerbäck, Thomas, Hollanti, Camilla: Constructions of optimal and almost optimal locally repairable codes, Global Wireless Summit, Aalborg, Denmark, May 2014.. [BibTeX...]
Page content by: webmaster-math [at] list [dot] aalto [dot] fi