Sascha Kurz

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 116

Top Venues

CoRR

Des. Codes Cryptogr.

Adv. Math. Commun.

IEEE Trans. Inf. Theory

Publications

Theresa Körner, Sascha Kurz
Lengths of divisible codes with restricted column multiplicities. Adv. Math. Commun. 18 (2) (2024)
Sascha Kurz
Computer classification of linear codes based on lattice point enumeration and integer linear programming. CoRR (2024)
Sascha Kurz
Non-projective two-weight codes. CoRR (2024)
Sascha Kurz
Non-Projective Two-Weight Codes. Entropy 26 (4) (2024)
Sascha Kurz
Computer Classification of Linear Codes Based on Lattice Point Enumeration. ICMS (2024)
Sascha Kurz
Bounds on the minimum distance of locally recoverable codes. CoRR (2024)
Sascha Kurz
Lengths of divisible codes: the missing cases. Des. Codes Cryptogr. 92 (8) (2024)
Sascha Kurz
The interplay of different metrics for the construction of constant dimension codes. Adv. Math. Commun. 17 (1) (2023)
Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese
Combining subspace codes. Adv. Math. Commun. 17 (3) (2023)
Theresa Körner, Sascha Kurz
Lengths of divisible codes with restricted column multiplicities. CoRR (2023)
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) (2023)
Sascha Kurz
Trifferent codes with small lengths. CoRR (2023)
Romar dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann
On the minimum number of minimal codewords. Adv. Math. Commun. 17 (2) (2023)
Sascha Kurz, Ivan N. Landjev, Assia Rousseva
Classification of $ \mathbf{(3 \!\mod 5)} $ arcs in $ \mathbf{ \operatorname{PG}(3,5)} $. Adv. Math. Commun. 17 (1) (2023)
Michael Kiermaier, Sascha Kurz
Classification of Δ-Divisible Linear Codes Spanned by Codewords of Weight Δ. IEEE Trans. Inf. Theory 69 (6) (2023)
Sascha Kurz
Lengths of divisible codes - the missing cases. CoRR (2023)
Sascha Kurz
Divisible minimal codes. CoRR (2023)
Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals
Irreducible Subcube Partitions. Electron. J. Comb. 30 (3) (2023)
Sascha Kurz, Dani Samaniego
Enumeration of simple games with two equivalence classes of players. Discret. Appl. Math. 334 (2023)
Sascha Kurz, Sam Mattheus
A Generalization of the Cylinder Conjecture for Divisible Codes. IEEE Trans. Inf. Theory 68 (4) (2022)
Minjia Shi, Michael Kiermaier, Sascha Kurz, Patrick Solé
Three-Weight Codes over Rings and Strongly Walk Regular Graphs. Graphs Comb. 38 (3) (2022)
Sascha Kurz
Capacity of generalized diamond networks. CoRR (2022)
Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals
Irreducible subcube partitions. CoRR (2022)
Sascha Kurz
On the number of minimal codewords in codes generated by the adjacency matrix of a graph. Discret. Appl. Math. 309 (2022)
Sascha Kurz
The interplay of different metrics for the construction of constant dimension codes. CoRR (2021)
Romar dela Cruz, Sascha Kurz
On the maximum number of minimal codewords. Discret. Math. 344 (9) (2021)
Sascha Kurz
Construction and bounds for subspace codes. CoRR (2021)
Sascha Kurz, Alexander Mayer, Stefan Napel
The Art and Beauty of Voting Power. CoRR (2021)
Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz
Computer Classification of Linear Codes. IEEE Trans. Inf. Theory 67 (12) (2021)
Sascha Kurz, Ivan N. Landjev, Assia Rousseva
Classification of 3 mod 5 arcs in PG(3, 5). CoRR (2021)
Sascha Kurz
code is unique. Adv. Math. Commun. 15 (3) (2021)
Sascha Kurz
No Projective 16-Divisible Binary Linear Code of Length 131 Exists. IEEE Commun. Lett. 25 (1) (2021)
Sascha Kurz
Bounds for flag codes. Des. Codes Cryptogr. 89 (12) (2021)
Sascha Kurz, Eitan Yaakobi
PIR Codes with Short Block Length. Des. Codes Cryptogr. 89 (3) (2021)
Sascha Kurz, Issofa Moyouwou, Hilaire Touyem
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output. Soc. Choice Welf. 56 (3) (2021)
Sascha Kurz
Divisible Codes. CoRR (2021)
Sascha Kurz, Dani Samaniego
A note on simple games with two equivalence classes of players. CoRR (2021)
Sascha Kurz
The Public Good index for games with several levels of approval in the input and output. CoRR (2021)
Sascha Kurz
A note on the growth of the dimension in complete simple games. Math. Soc. Sci. 110 (2021)
Sascha Kurz
A note on the growth of the dimension in complete simple games. CoRR (2020)
Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak
Subspace packings: constructions and bounds. Des. Codes Cryptogr. 88 (9) (2020)
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson
Efficient Storage Schemes for Desired Service Rate Regions. ITW (2020)
Michael Kiermaier, Sascha Kurz
On the Lengths of Divisible Codes. IEEE Trans. Inf. Theory 66 (7) (2020)
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. CoRR (2020)
Sascha Kurz
Subspaces intersecting in at most a point. Des. Codes Cryptogr. 88 (3) (2020)
Sascha Kurz, Eitan Yaakobi
PIR Codes with Short Block Length. CoRR (2020)
Sascha Kurz
Are weighted games sufficiently good for binary voting? CoRR (2020)
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin
A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes. ISIT (2020)
Sascha Kurz
No projective 16-divisible binary linear code of length 131 exists. CoRR (2020)
Sascha Kurz, Issofa Moyouwou, Hilaire Touyem
Axiomatizations for the Shapley-Shubik power index for games with several levels of approval in the input and output. CoRR (2020)
Sascha Kurz, Alexander Mayer, Stefan Napel
Weighted committee games. Eur. J. Oper. Res. 282 (3) (2020)
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
Simple games versus weighted voting games: bounding the critical threshold value. Soc. Choice Welf. 54 (4) (2020)
Sascha Kurz
Lifted codes and the multilevel construction for constant dimension codes. CoRR (2020)
Tao Feng, Sascha Kurz, Shuangqing Liu
Bounds for the multilevel construction. CoRR (2020)
Fatemeh Kazemi, Sascha Kurz, Emina Soljanin, Alex Sprintson
Efficient Storage Schemes for Desired Service Rate Regions. CoRR (2020)
Sascha Kurz
Generalized LMRD Code Bounds for Constant Dimension Codes. IEEE Commun. Lett. 24 (10) (2020)
Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann
The Lengths of Projective Triply-Even Binary Codes. IEEE Trans. Inf. Theory 66 (5) (2020)
Sascha Kurz
Classification of 8-divisible binary linear codes with minimum distance 24. CoRR (2020)
Romar dela Cruz, Sascha Kurz
On the maximum number of minimal codewords. CoRR (2020)
Iliya Bouyukliev, Stefka Bouyuklieva, Sascha Kurz
Computer classification of linear codes. CoRR (2020)
Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz
Generalized vector space partitions. Australas. J Comb. 73 (2019)
Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak
Subspace Packings - Constructions and Bounds. CoRR (2019)
Sascha Kurz
LinCode - computer classification of linear codes. CoRR (2019)
Josep Freixas, Sascha Kurz
Bounds for the Nakamura number. Soc. Choice Welf. 52 (4) (2019)
Sascha Kurz, Issofa Moyouwou, Hilaire Touyem
An Axiomatization of the Shapley-Shubik Index for Interval Decisions. CoRR (2019)
Antonio Cossidente, Sascha Kurz, Giuseppe Marino, Francesco Pavese
Combining subspace codes. CoRR (2019)
Sascha Kurz, Alexander Mayer, Stefan Napel
Influence in Weighted Committees. CoRR (2019)
Sascha Kurz
code is unique. CoRR (2019)
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) (2019)
Sascha Kurz
Subspaces intersecting in at most a point. CoRR (2019)
Sascha Kurz
A note on the linkage construction for constant dimension codes. CoRR (2019)
Daniel Heinlein, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87 (2-3) (2019)
Thomas Honold, Michael Kiermaier, Sascha Kurz
Johnson Type Bounds for Mixed Dimension Subspace Codes. Electron. J. Comb. 26 (3) (2019)
Serguei Kaniovski, Sascha Kurz
Representation-compatible power indices. Ann. Oper. Res. 264 (1-2) (2018)
Sascha Kurz
Which criteria qualify power indices for applications? - A comment to "The story of the poor Public Good index". CoRR (2018)
Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann
The lengths of projective triply-even binary codes. CoRR (2018)
Daniel Heinlein, Sascha Kurz
Binary Subspace Codes in Small Ambient Spaces. CoRR (2018)
Sascha Kurz, Stefan Napel
The roll call interpretation of the Shapley value. CoRR (2018)
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) (2018)
Sascha Kurz, Nicola Maaser, Stefan Napel
Fair representation and a linear Shapley rule. Games Econ. Behav. 108 (2018)
Sascha Kurz
The power of the largest player. CoRR (2018)
Tuvi Etzion, Sascha Kurz, Kamil Otal, Ferruh Özbudak
Subspace Packings. CoRR (2018)
Sascha Kurz
Heden's bound on the tail of a vector space partition. Discret. Math. 341 (12) (2018)
Frits Hof, Walter Kern, Sascha Kurz, Kanstantsin Pashkovich, Daniël Paulusma
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold Value. CoRR (2018)
Sascha Kurz
A note on limit results for the Penrose-Banzhaf index. CoRR (2018)
Sascha Kurz
Bounds for the diameter of the weight polytope. CoRR (2018)
Sascha Kurz
Importance in Systems with interval Decisions. Adv. Complex Syst. 21 (6-7) (2018)
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
Simple Games versus Weighted Voting Games. CoRR (2018)
Sascha Kurz
Approximating power by weights. CoRR (2018)
Daniel Heinlein, Sascha Kurz
Binary subspace codes in small ambient spaces. Adv. Math. Commun. 12 (4) (2018)
Sascha Kurz
Correction to: On minimum sum representations for weighted voting games. Ann. Oper. Res. 271 (2) (2018)
Sascha Kurz
Influence in systems with convex decisions. CoRR (2018)
Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
Simple Games Versus Weighted Voting Games. SAGT (2018)
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, Gerhard J. Woeginger
Group activity selection problem with approval preferences. Int. J. Game Theory 47 (3) (2018)
Sascha Kurz
Packing vector spaces into vector spaces. Australas. J Comb. 68 (2017)
Sascha Kurz
Improved upper bounds for partial spreads. Des. Codes Cryptogr. 85 (1) (2017)
Michael Kiermaier, Sascha Kurz
An improvement of the Johnson bound for subspace codes. CoRR (2017)
Daniel Heinlein, Sascha Kurz
Coset Construction for Subspace Codes. IEEE Trans. Inf. Theory 63 (12) (2017)
Maurice Koster, Sascha Kurz, Ines Lindner, Stefan Napel
The prediction value. Soc. Choice Welf. 48 (2) (2017)
Daniel Heinlein, Sascha Kurz
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound. CoRR (2017)

Sascha Kurz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sascha Kurz