default search action
Michael Kiermaier
Person information
- affiliation: Bayreuth University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j33]Romar dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
On the minimum number of minimal codewords. Adv. Math. Commun. 17(2): 333-341 (2023) - [j32]Michael Kiermaier
, Sascha Kurz, Patrick Solé, Michael Stoll, Alfred Wassermann:
On strongly walk regular graphs, triple sum sets and their codes. Des. Codes Cryptogr. 91(2): 645-675 (2023) - [j31]Michael Kiermaier
Classification of Δ-Divisible Linear Codes Spanned by Codewords of Weight Δ. IEEE Trans. Inf. Theory 69(6): 3544-3551 (2023) - 2022
- [j30]Michael Kiermaier
On α-points of q-analogs of the Fano plane. Des. Codes Cryptogr. 90(6): 1335-1345 (2022) - [j29]Minjia Shi, Michael Kiermaier, Sascha Kurz, Patrick Solé:
Three-Weight Codes over Rings and Strongly Walk Regular Graphs. Graphs Comb. 38(3): 56 (2022) - [i9]Tao Feng, Michael Kiermaier, Peixian Lin, Kai-Uwe Schmidt:
Linear codes associated with the Desarguesian ovoids in Q+(7, q). CoRR abs/2208.12919 (2022) - 2020
- [j28]Thomas Honold, Michael Kiermaier
The Lengths of Projective Triply-Even Binary Codes. IEEE Trans. Inf. Theory 66(5): 2713-2716 (2020) - [j27]Michael Kiermaier
On the Lengths of Divisible Codes. IEEE Trans. Inf. Theory 66(7): 4051-4060 (2020) - [c2]Thomas Honold, Michael Kiermaier, Ivan N. Landjev:
New upper bounds on the maximal size of an arc in a projective Hjelmslev plane. ACCT 2020: 1-10
2010 – 2019
- 2019
- [j26]Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz:
Generalized vector space partitions. Australas. J Comb. 73: 162-178 (2019) - [j25]Michael Braun, Michael Kiermaier, Reinhard Laue:
New 2-designs over finite fields from derived and residual designs. Adv. Math. Commun. 13(1): 165-170 (2019) - [j24]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. Adv. Math. Commun. 13(3): 457-475 (2019) - [j23]Thomas Honold, Michael Kiermaier, Sascha Kurz
Johnson Type Bounds for Mixed Dimension Subspace Codes. Electron. J. Comb. 26(3): 3 (2019) - [j22]Daniel Heinlein
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87(2-3): 375-391 (2019) - 2018
- [j21]Michael Kiermaier, Sascha Kurz, Alfred Wassermann
The order of the automorphism group of a binary q -analog of the Fano plane is at most two. Des. Codes Cryptogr. 86(2): 239-250 (2018) - [j20]Michael Kiermaier, Reinhard Laue, Alfred Wassermann:
A new series of large sets of subspace designs over the binary field. Des. Codes Cryptogr. 86(2): 251-268 (2018) - [i8]Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The lengths of projective triply-even binary codes. CoRR abs/1812.05957 (2018) - 2017
- [j19]Michael Braun, Michael Kiermaier, Axel Kohnert, Reinhard Laue:
Large sets of subspace designs. J. Comb. Theory A 147: 155-185 (2017) - [i7]Michael Kiermaier, Sascha Kurz:
An improvement of the Johnson bound for subspace codes. CoRR abs/1707.00650 (2017) - [i6]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. CoRR abs/1708.06224 (2017) - 2016
- [j18]Javier de la Cruz, Michael Kiermaier, Alfred Wassermann, Wolfgang Willems:
Algebraic structures of MRD codes. Adv. Math. Commun. 10(3): 499-510 (2016) - [j17]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Constructions and bounds for mixed-dimension subspace codes. Adv. Math. Commun. 10(3): 649-682 (2016) - [j16]Adalbert Kerber, Michael Kiermaier, Reinhard Laue, Mario-Osvin Pavcevic
Editorial. Adv. Math. Commun. 10(3): i-ii (2016) - [j15]Javier de la Cruz, Michael Kiermaier, Alfred Wassermann:
The automorphism group of an extremal [120, 60, 24] code does not contain elements of order 29. Des. Codes Cryptogr. 78(3): 693-702 (2016) - [j14]Michael Braun, Michael Kiermaier, Anamari Nakic
On the automorphism group of a binary q-analog of the Fano plane. Eur. J. Comb. 51: 443-457 (2016) - [j13]Michael Kiermaier, Alfred Wassermann
New Upper Bounds on Binary Linear Codes and a Z4 -Code With a Better-Than-Linear Gray Image. IEEE Trans. Inf. Theory 62(12): 6768-6771 (2016) - [i5]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
Tables of subspace codes. CoRR abs/1601.02864 (2016) - 2015
- [j12]Michael Kiermaier, Reinhard Laue:
Derived and residual subspace designs. Adv. Math. Commun. 9(1): 105-115 (2015) - [i4]Javier de la Cruz, Michael Kiermaier, Alfred Wassermann, Wolfgang Willems:
Algebraic structures of MRD Codes. CoRR abs/1502.02711 (2015) - [i3]Michael Kiermaier, Alfred Wassermann, Johannes Zwanzger:
New upper bounds on binary linear codes and a ℤ4-code with a better-than-linear Gray image. CoRR abs/1503.03394 (2015) - [i2]Thomas Honold, Michael Kiermaier, Sascha Kurz:
Constructions and Bounds for Mixed-Dimension Subspace Codes. CoRR abs/1512.06660 (2015) - 2014
- [j11]Claude Carlet, Finley Freibert, Sylvain Guilley, Michael Kiermaier, Jon-Lark Kim, Patrick Solé:
Higher-Order CIS Codes. IEEE Trans. Inf. Theory 60(9): 5283-5295 (2014) - [i1]Claude Carlet, Finley Freibert, Sylvain Guilley, Michael Kiermaier, Jon-Lark Kim, Patrick Solé:
Higher-order CIS codes. CoRR abs/1406.4547 (2014) - 2013
- [j10]Michael Kiermaier, Johannes Zwanzger:
New ring-linear codes from dualization in projective Hjelmslev geometries. Des. Codes Cryptogr. 66(1-3): 39-55 (2013) - [j9]Thomas Honold, Michael Kiermaier:
The existence of maximal (q 2, 2)-arcs in projective Hjelmslev planes over chain rings of length 2 and odd prime characteristic. Des. Codes Cryptogr. 68(1-3): 105-126 (2013) - [j8]Michael Kiermaier:
Codes from translation schemes on Galois rings of characteristic 4. Electron. Notes Discret. Math. 40: 175-180 (2013) - [j7]Michael Kiermaier:
There is No Self-Dual ℤ4-Linear Code Whose Gray Image Has the Parameters (72, 236, 16). IEEE Trans. Inf. Theory 59(6): 3384-3386 (2013) - 2012
- [j6]Eimear Byrne, Michael Kiermaier, Alison Sneyd
Properties of codes with two homogeneous weights. Finite Fields Their Appl. 18(4): 711-727 (2012) - [j5]Michael Kiermaier, Alfred Wassermann:
Minimum Weights and Weight Enumerators of BBZ4-Linear Quadratic Residue Codes. IEEE Trans. Inf. Theory 58(7): 4870-4883 (2012) - 2011
- [j4]Michael Kiermaier, Johannes Zwanzger:
A ℤ4-linear code of high minimum Lee distance derived from a hyperoval. Adv. Math. Commun. 5(2): 275-286 (2011) - [j3]Michael Kiermaier, Matthias Koch, Sascha Kurz:
2-arcs of maximal size in the affine and the projective Hjelmslev plane over ℤ25. Adv. Math. Commun. 5(2): 287-301 (2011) - 2010
- [j2]Masaaki Harada, Michael Kiermaier, Alfred Wassermann, Radinka Yorgova:
New binary singly even self-dual codes. IEEE Trans. Inf. Theory 56(4): 1612-1617 (2010)
2000 – 2009
- 2009
- [j1]Michael Kiermaier, Sascha Kurz:
Maximal integral point sets in affine planes over finite fields. Discret. Math. 309(13): 4564-4575 (2009) - 2008
- [c1]Michael Kiermaier, Alfred Wassermann:
On the minimum Lee distance of quadratic residue codes over ℤ44. ISIT 2008: 2617-2619
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-10-07 22:13 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: