Projekte: Integer Linear Programming Models for Subspace Codes and Finite Geometry

Kiermaier, Michael ; Kurz, Sascha:
On the lengths of divisible codes.
Bayreuth , 2020 . - 17 S.

Kiermaier, Michael ; Kurz, Sascha:
On the lengths of divisible codes.
In: IEEE Transactions on Information Theory. Bd. 66 (2020) Heft 7 . - S. 4051-4060.
DOI: https://doi.org/10.1109/TIT.2020.2968832

Kiermaier, Michael ; Kurz, Sascha:
On the lengths of divisible codes.
Bayreuth , 2019 . - 17 S.

Kurz, Sascha:
Heden's bound on the tail of a vector space partition.
Bayreuth , 2018 . - 5 S.

Kiermaier, Michael ; Kurz, Sascha:
An improvement of the Johnson bound for subspace codes.
Bayreuth , 2018 . - 12 S.

Kurz, Sascha:
Heden's bound on the tail of a vector space partition.
In: Discrete Mathematics. Bd. 341 (2018) Heft 12 . - S. 3447-3452.
DOI: https://doi.org/10.1016/j.disc.2018.09.003

Heinlein, Daniel ; Kurz, Sascha:
An upper bound for binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
In: Augot, Daniel ; Krouk, Evgeny ; Loidreau, Pierre (Hrsg.): The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings. - Saint-Petersburg , 2017

Heinlein, Daniel ; Kurz, Sascha:
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound.
In: Barbero, Ángela I. ; Skachek, Vitaly ; Ytrehus, Øyvind (Hrsg.): Coding Theory and Applications : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings. - Cham : Springer International Publishing, 2017 . - S. 163-191 . - (Lecture Notes in Computer Science ; 10495 )
DOI: https://doi.org/10.1007/978-3-319-66278-7_15

Heinlein, Daniel ; Kurz, Sascha:
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound.
Bayreuth , 2017 . - 30 S.

Braun, Michael ; Wassermann, Alfred:
Disjoint q-Steiner systems in dimension 13.
Bayreuth , 2017 . - 55 S.

Heinlein, Daniel ; Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Projective divisible binary codes.
Bayreuth , 2017 . - 10 S.

Heinlein, Daniel ; Kurz, Sascha:
A new upper bound for subspace codes.
Bayreuth , 2017 . - 9 S.

Kurz, Sascha:
Packing vector spaces into vector spaces.
In: The Australasian Journal of Combinatorics. Bd. 68 (2017) Heft 1 . - S. 122-130.

Heinlein, Daniel ; Honold, Thomas ; Kiermaier, Michael ; Kurz, Sascha ; Wassermann, Alfred:
Projective divisible binary codes.
In: Augot, Daniel ; Krouk, Evgeny ; Loidreau, Pierre (Hrsg.): The Tenth International Workshop on Coding and Cryptography 2017 : WCC Proceedings. - Saint-Petersburg , 2017