Sascha Kurz

On the number of minimal codewords in codes generated by the adjacency matrix of a graph

2020 · ERef Bayreuth (University of Bayreuth)

Minimal codewords have applications in decoding linear codes and in cryptography. We study the number of minimal codewords in binary linear codes that arise by appending a unit matrix to the adjacency matrix of a …

Classification of $3 \operatorname{mod} 5$ arcs in $\operatorname{PG}(3,5)$

2021 · arXiv (Cornell University)

The proof of the non-existence of Griesmer $[104, 4, 82]_5$-codes is just one of many examples where extendability results are used. In a series of papers Landjev and Rousseva have introduced the concept of $(t\operatorname{mod} …