Alfred Wassermann

Alfred Wassermann

Auto-generated profile, based on publicly available information

Alfred Wassermann

Department of Mathematics, University of Bayreuth, Bayreuth, Germany

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 August 2016 in Forum of Mathematics, Pi
Verified
Journal Article
Open access
PDF file
AAA A
A A
TETuvi Etzion
Tuvi Etzion
PÖPatric R. J. Östergård
Patric R. J. Östergård
AVAlexander Vardy
Alexander Vardy
AWAlfred Wassermann
Alfred Wassermann
Let $\mathbb{F}_{q}^{n}$ be a vector space of dimension $n$ over the finite field $\mathbb{F}_{q}$ . A $q$ -analog of a Steiner system (also known as a $q$ -Steiner system), denoted ${\mathcal{S}}_{q}(t,\!k,\!n)$ , is a set ${\mathcal{S}}$ of $k$ -dimensional subspaces of $\mathbb{F}_{q}^{n}$ such that each $t$ -dimensional subspace of $\mathbb{F}_{q}^{n}$ is contained in exactly one element of ${\mathcal{S}}$ . Presently, $q$ -Steiner systems are known only for $t\,=\,1\!$ , and in the trivial cases $t\,=\,k$ and $k\,=\,n$ . In this paper, the first nontrivial $q$ -Steiner systems with $t\,\geqslant \,2$ are constructed. Specifically, several nonisomorphic $q$ -Steiner systems ${\mathcal{S}}_{2}(2,3,13)$ are found by requiring that their automorphism groups contain the normalizer of a Singer subgroup of $\text{GL}(13,2)$ . This approach leads to an instance of the exact cover problem, which turns out to have many solutions.

1 January 2016 in Advances in Mathematics of Communications
Verified
Journal Article
Open access
PDF file
JCJavier de la Cruz
Javier de la Cruz
MKMichael Kiermaier
Michael Kiermaier
AWAlfred Wassermann
Alfred Wassermann
WWWolfgang Willems
Wolfgang Willems
Based on results in finite geometry we prove the existence of MRD codes in $(\mathbb{F}_q)_{n,n}$ with minimum distance $n$ which are essentially different from Gabidulin codes. The construction results from algebraic structures which are closely related to those of finite fields. Some of the results may be known to experts, but to our knowledge have never been pointed out explicitly in the literature.

3 September 2018 in Designs, Codes and Cryptography
Verified
Journal Article
Open access
PDF file
DHDaniel Heinlein
Daniel Heinlein
THThomas Honold
Thomas Honold
MKMichael Kiermaier
Michael Kiermaier
SKSascha Kurz
Sascha Kurz
AWAlfred Wassermann
Alfred Wassermann
We determine the maximum size \(A_2(8,6;4)\) of a binary subspace code of packet length \(v=8\), minimum subspace distance \(d=6\), and constant dimension \(k=4\) to be 257. There are two isomorphism types of optimal codes. Both of them are extended LMRD codes. In finite geometry terms, the maximum number of solids in \({\text {PG}}(7,2)\) mutually intersecting in at most a point is 257. The result was obtained by combining the classification of substructures with integer linear programming techniques. This result implies that the maximum size \(A_2(8,6)\) of a binary mixed-dimension subspace code of packet length 8 and minimum subspace distance 6 is 257 as well.

1 January 1998 in Journal of Combinatorial Designs
Verified
Journal Article
Closed access
PDF file
AWAlfred Wassermann
Alfred Wassermann

1 January 2005 in Innovations in Incidence Geometry: Algebraic, Topological and Combinatorial
Verified
Journal Article
Closed access
PDF file
AAA A
A A
AKAxel Kohnert
Axel Kohnert
AWAlfred Wassermann
Alfred Wassermann

1 December 2020 in Journal of Combinatorial Designs
Verified
Journal Article
Closed access
PDF file
MBMarco Buratti
Marco Buratti
ANAnamari Nakić
Anamari Nakić
AWAlfred Wassermann
Alfred Wassermann