default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Westerbäck
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Ragnar Freij-Hollanti, Matthias Grezet
, Camilla Hollanti, Thomas Westerbäck:
Cyclic flats of binary matroids. Adv. Appl. Math. 127: 102165 (2021)
2010 – 2019
- 2019
- [j13]Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Uniform Minors in Maximally Recoverable Codes. IEEE Commun. Lett. 23(8): 1297-1300 (2019) - [j12]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. IEEE Trans. Inf. Theory 65(10): 6089-6100 (2019) - [i13]Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Uniform Minors in Maximally Recoverable Codes. CoRR abs/1906.02423 (2019) - 2018
- [i12]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes. CoRR abs/1810.08510 (2018) - 2017
- [j11]Thomas Westerbäck:
Parity check systems of nonlinear codes over finite commutative Frobenius rings. Adv. Math. Commun. 11(3): 409-427 (2017) - [c6]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
On Binary Matroid Minors and Applications to Data Storage over Small Fields. ICMCTA 2017: 139-153 - [i11]Ragnar Freij-Hollanti, Camilla Hollanti, Thomas Westerbäck:
Matroid Theory and Storage Codes: Bounds and Constructions. CoRR abs/1704.04007 (2017) - [i10]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Camilla Hollanti:
On Binary Matroid Minors and Applications to Data Storage over Small Fields. CoRR abs/1707.00421 (2017) - [i9]Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck, Oktay Olmez, Camilla Hollanti:
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures. CoRR abs/1709.05801 (2017) - 2016
- [j10]Petteri Kaski, Jukka Kohonen, Thomas Westerbäck:
Fast Möbius Inversion in Semimodular Lattices and ER-labelable Posets. Electron. J. Comb. 23(3): 3 (2016) - [j9]Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Constructions and Properties of Linear Locally Repairable Codes. IEEE Trans. Inf. Theory 62(3): 1129-1143 (2016) - [j8]Thomas Westerbäck, Ragnar Freij-Hollanti, Toni Ernvall, Camilla Hollanti:
On the Combinatorics of Locally Repairable Codes via Matroid Theory. IEEE Trans. Inf. Theory 62(10): 5296-5315 (2016) - [c5]Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
A connection between locally repairable codes and exact regenerating codes. ISIT 2016: 650-654 - [c4]Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Bounds on the maximal minimum distance of linear locally repairable codes. ISIT 2016: 1586-1590 - [i8]Antti Pöllänen, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Improved Singleton-type Bounds for Locally Repairable Codes. CoRR abs/1602.04482 (2016) - [i7]Toni Ernvall, Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
A Connection Between Locally Repairable Codes and Exact Regenerating Codes. CoRR abs/1603.05846 (2016) - [i6]Thomas Westerbäck:
Parity check systems of nonlinear codes over finite commutative Frobenius rings. CoRR abs/1604.06996 (2016) - 2015
- [j7]Thomas Britz, Keisuke Shiromoto, Thomas Westerbäck:
Demi-matroids from codes over finite Frobenius rings. Des. Codes Cryptogr. 75(1): 97-107 (2015) - [c3]Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Applications of polymatroid theory to distributed storage systems. Allerton 2015: 231-237 - [i5]Thomas Westerbäck, Ragnar Freij, Toni Ernvall, Camilla Hollanti:
On the Combinatorics of Locally Repairable Codes via Matroid Theory. CoRR abs/1501.00153 (2015) - [i4]Thomas Westerbäck, Ragnar Freij-Hollanti, Camilla Hollanti:
Applications of Polymatroid Theory to Distributed Storage Systems. CoRR abs/1510.02499 (2015) - 2014
- [c2]Thomas Westerbäck, Toni Ernvall, Camilla Hollanti:
Almost affine locally repairable codes and matroid theory. ITW 2014: 621-625 - [c1]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti:
Constructions of optimal and almost optimal locally repairable codes. VITAE 2014: 1-5 - [i3]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti:
Constructions of Optimal and Almost Optimal Locally Repairable Codes. CoRR abs/1406.4277 (2014) - [i2]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti:
Linear Locally Repairable Codes with Random Matrices. CoRR abs/1408.0180 (2014) - [i1]Toni Ernvall, Thomas Westerbäck, Camilla Hollanti, Ragnar Freij:
Constructions and Properties of Linear Locally Repairable Codes. CoRR abs/1410.6339 (2014) - 2012
- [j6]Olof Heden, Fabio Pasticci, Thomas Westerbäck:
On the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2. Adv. Math. Commun. 6(2): 121-130 (2012) - 2010
- [j5]Olof Heden, Martin Hessler, Thomas Westerbäck:
On the classification of perfect codes: Extended side class structures. Discret. Math. 310(1): 43-55 (2010)
2000 – 2009
- 2009
- [j4]Olof Heden, Fabio Pasticci, Thomas Westerbäck:
On the existence of extended perfect binary codes with trivial symmetry group. Adv. Math. Commun. 3(3): 295-309 (2009) - [j3]Fabio Pasticci, Thomas Westerbäck:
On rank and kernel of some mixed perfect codes. Discret. Math. 309(9): 2763-2774 (2009) - 2007
- [j2]Olof Heden, Thomas Westerbäck:
Non Phelps codes of length 15 and rank 14. Australas. J Comb. 38: 141-154 (2007) - [j1]Thomas Westerbäck:
Maximal partial packings of Z2n with perfect codes. Des. Codes Cryptogr. 42(3): 335-355 (2007)
Coauthor Index
aka: Ragnar Freij-Hollanti
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
