default search action
Thomas Britz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j24]Changyuan Wang, R. Julian R. Abel
, Thomas Britz
Group divisible designs with block size 4 and group sizes 4 and 10 and some other 4-GDDs. Discret. Math. 348(2): 114254 (2025) - 2024
- [j23]Thomas Britz
Harmonic Tutte polynomials of matroids II. Des. Codes Cryptogr. 92(5): 1279-1297 (2024) - 2023
- [j22]R. Julian R. Abel
Group divisible designs with block size 4 where the group sizes are congruent to 1 mod 3. Discret. Math. 346(4): 113277 (2023) - 2022
- [j21]R. Julian R. Abel
Group divisible designs with block size 4 where the group sizes are congruent to 2 mod 3. Discret. Math. 345(3): 112740 (2022) - [i3]Thomas Britz
Harmonic Tutte polynomials of matroids II. CoRR abs/2210.16490 (2022) - 2020
- [j20]Thomas Britz
Mutually Orthogonal Binary Frequency Squares. Electron. J. Comb. 27(3): 3 (2020) - [j19]Thomas Britz
Wei-type duality theorems for rank metric codes. Des. Codes Cryptogr. 88(8): 1503-1519 (2020)
2010 – 2019
- 2018
- [j18]Adam Mammoliti, Thomas Britz
On Mubayi's Conjecture and Conditionally Intersecting Sets. SIAM J. Discret. Math. 32(3): 2361-2380 (2018) - 2016
- [j17]Thomas Britz
On the Covering Dimension of a Linear Code. IEEE Trans. Inf. Theory 62(5): 2694-2701 (2016) - 2015
- [j16]Thomas Britz
Maximal Partial Latin Cubes. Electron. J. Comb. 22(1): 1 (2015) - [j15]Thomas Britz
Demi-matroids from codes over finite Frobenius rings. Des. Codes Cryptogr. 75(1): 97-107 (2015) - [i2]Thomas Britz
On the covering dimension of a linear code. CoRR abs/1504.02357 (2015) - 2014
- [j14]Thomas Britz
Chains, Demi-Matroids, and Profiles. IEEE Trans. Inf. Theory 60(2): 986-991 (2014) - 2013
- [j13]Terence H. Chan
Quasi-Uniform Codes and Their Applications. IEEE Trans. Inf. Theory 59(12): 7915-7926 (2013) - 2012
- [j12]Thomas Britz
Wei-type duality theorems for matroids. Des. Codes Cryptogr. 62(3): 331-341 (2012) - 2010
- [j11]Thomas Britz
Code enumerators and tutte polynomials. IEEE Trans. Inf. Theory 56(9): 4350-4358 (2010) - [c1]Terence H. Chan
Properties of quasi-uniform codes. ISIT 2010: 1153-1157
2000 – 2009
- 2009
- [j10]Thomas Britz
Designs from Matroids. SIAM J. Discret. Math. 23(2): 1082-1099 (2009) - [i1]Thomas Britz
Generalizations of Wei's Duality Theorem. CoRR abs/0910.2099 (2009) - 2008
- [j9]Thomas Britz
Designs from subcode supports of linear codes. Des. Codes Cryptogr. 46(2): 175-189 (2008) - [j8]Thomas Britz
A MacWilliams type identity for matroids. Discret. Math. 308(20): 4551-4559 (2008) - 2007
- [j7]Thomas Britz
Higher support matroids. Discret. Math. 307(17-18): 2300-2308 (2007) - [j6]Dieter Britz, Thomas Britz
The Higher Weight Enumerators of the Doubly-Even, Self-Dual [48, 24, 12] Code. IEEE Trans. Inf. Theory 53(7): 2567-2571 (2007) - 2006
- [j5]Thomas Britz
On P-weight and P-distance inequalities. Discret. Math. 306(6): 598-599 (2006) - 2005
- [j4]Thomas Britz
Covering radii are not matroid invariants. Discret. Math. 296(1): 117-120 (2005) - [j3]Thomas Britz
Extensions of the Critical Theorem. Discret. Math. 305(1-3): 55-73 (2005) - 2004
- [j2]Thomas Britz
Minimal Spectrally Arbitrary Sign Patterns. SIAM J. Matrix Anal. Appl. 26(1): 257-271 (2004) - 2002
- [j1]Thomas Britz
MacWilliams Identities and Matroid Polynomials. Electron. J. Comb. 9(1) (2002)
Coauthor Index
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-12-10 20:50 CET 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: