Michael Kiermaier

Orcid: 0000-0002-5901-4381

Affiliations:
  • Bayreuth University, Germany


According to our database1, Michael Kiermaier authored at least 38 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Classification of Δ-Divisible Linear Codes Spanned by Codewords of Weight Δ.
IEEE Trans. Inf. Theory, June, 2023

On strongly walk regular graphs, triple sum sets and their codes.
Des. Codes Cryptogr., February, 2023

On the minimum number of minimal codewords.
Adv. Math. Commun., 2023

2022
Three-Weight Codes over Rings and Strongly Walk Regular Graphs.
Graphs Comb., 2022

On α-points of q-analogs of the Fano plane.
Des. Codes Cryptogr., 2022

Linear codes associated with the Desarguesian ovoids in Q<sup>+</sup>(7, q).
CoRR, 2022

2020
On the Lengths of Divisible Codes.
IEEE Trans. Inf. Theory, 2020

The Lengths of Projective Triply-Even Binary Codes.
IEEE Trans. Inf. Theory, 2020

New upper bounds on the maximal size of an arc in a projective Hjelmslev plane.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Des. Codes Cryptogr., 2019

Johnson Type Bounds for Mixed Dimension Subspace Codes.
Electron. J. Comb., 2019

A subspace code of size 333 in the setting of a binary q-analog of the Fano plane.
Adv. Math. Commun., 2019

New 2-designs over finite fields from derived and residual designs.
Adv. Math. Commun., 2019

Generalized vector space partitions.
Australas. J Comb., 2019

2018
A new series of large sets of subspace designs over the binary field.
Des. Codes Cryptogr., 2018

The order of the automorphism group of a binary q -analog of the Fano plane is at most two.
Des. Codes Cryptogr., 2018

2017
Large sets of subspace designs.
J. Comb. Theory A, 2017

An improvement of the Johnson bound for subspace codes.
CoRR, 2017

2016
New Upper Bounds on Binary Linear Codes and a Z<sub>4</sub> -Code With a Better-Than-Linear Gray Image.
IEEE Trans. Inf. Theory, 2016

On the automorphism group of a binary q-analog of the Fano plane.
Eur. J. Comb., 2016

The automorphism group of an extremal [120, 60, 24] code does not contain elements of order 29.
Des. Codes Cryptogr., 2016

Tables of subspace codes.
CoRR, 2016

Editorial.
Adv. Math. Commun., 2016

Constructions and bounds for mixed-dimension subspace codes.
Adv. Math. Commun., 2016

Algebraic structures of MRD codes.
Adv. Math. Commun., 2016

2015
Derived and residual subspace designs.
Adv. Math. Commun., 2015

2014
Higher-Order CIS Codes.
IEEE Trans. Inf. Theory, 2014

2013
There is No Self-Dual ℤ<sub>4</sub>-Linear Code Whose Gray Image Has the Parameters (72, 2<sup>36</sup>, 16).
IEEE Trans. Inf. Theory, 2013

Codes from translation schemes on Galois rings of characteristic 4.
Electron. Notes Discret. Math., 2013

New ring-linear codes from dualization in projective Hjelmslev geometries.
Des. Codes Cryptogr., 2013

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., 2013

2012
Minimum Weights and Weight Enumerators of BBZ<sub>4</sub>-Linear Quadratic Residue Codes.
IEEE Trans. Inf. Theory, 2012

Properties of codes with two homogeneous weights.
Finite Fields Their Appl., 2012

2011
A ℤ<sub><i>4</i></sub>-linear code of high minimum Lee distance derived from a hyperoval.
Adv. Math. Commun., 2011

2-arcs of maximal size in the affine and the projective Hjelmslev plane over ℤ<sub><i>25</i></sub>.
Adv. Math. Commun., 2011

2010
New binary singly even self-dual codes.
IEEE Trans. Inf. Theory, 2010

2009
Maximal integral point sets in affine planes over finite fields.
Discret. Math., 2009

2008
On the minimum Lee distance of quadratic residue codes over ℤ44.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...