Daniel Heinlein

Most-cited papers

Tables of subspace codes
Daniel Heinlein, Michael Kiermaier, Sascha Kurz, A. Wassermann
2016arXiv.org98 citations
Semantic Scholar
Coset Construction for Subspace Codes
Daniel Heinlein, Sascha Kurz
2015IEEE Transactions on Information Theory51 citations Open access
Semantic Scholar
Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound
Daniel Heinlein, Sascha Kurz
2017International Castle Meeting on Coding Theory and Applications44 citations Open access
Semantic Scholar
Degree Tables for Secure Distributed Matrix Multiplication
G. L. Rafael D'Oliveira, S. E. El Rouayheb, Daniel Heinlein, D. Karpuk
2019Information Theory Workshop41 citations
Semantic Scholar
Generalized Linkage Construction for Constant-Dimension Codes
Daniel Heinlein
2019IEEE Transactions on Information Theory37 citations Open access
Semantic Scholar
Notes on Communication and Computation in Secure Distributed Matrix Multiplication
Rafael G. L. D'Oliveira, S. E. El Rouayheb, Daniel Heinlein, D. Karpuk
2020IEEE Conference on Communications and Network Security36 citations Open access
Semantic Scholar
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
2017Designs, Codes and Cryptography26 citations Open access
Semantic Scholar
Projective divisible binary codes
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
201723 citations
Semantic Scholar
Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication
Roberto Assis Machado, Rafael G. L. D'Oliveira, S. E. El Rouayheb, Daniel Heinlein
2021International Symposium "Problems of Redundancy in Information and Control Systems"18 citations Open access
Semantic Scholar
New LMRD bounds for constant dimension codes and improved constructions
Daniel Heinlein
2018arXiv.org14 citations
Semantic Scholar
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane
Daniel Heinlein, Michael Kiermaier, Sascha Kurz, A. Wassermann
2017Advances in Mathematics of Communications14 citations Open access
Semantic Scholar
An upper bound for binary subspace codes of length 8, constant dimension 4 and minimum distance 6
Daniel Heinlein, Sascha Kurz
201710 citations
Semantic Scholar
Secure Distributed Matrix Multiplication with Precomputation
Ryann Cartor, Rafael G. L. D'Oliveira, Salim Rouayheb, Daniel Heinlein +2 more
2024International Symposium on Information Theory9 citations Open access
Semantic Scholar
Generalized vector space partitions
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz
2018The Australasian Journal of Combinatorics8 citations
Semantic Scholar
A new upper bound for subspace codes
Daniel Heinlein, Sascha Kurz
20177 citations
Semantic Scholar
Steiner triple systems of order 21 with subsystems
Daniel Heinlein, Patric R. J. Ostergård
2021Glasnik Matematicki - Serija III5 citations Open access
Semantic Scholar
Enumerating Steiner triple systems
Daniel Heinlein, P. Östergård
2023Journal of combinatorial designs (Print)4 citations Open access
Semantic Scholar
Degree Tables for Secure Distributed Matrix Multiplication
Rafael G. L. D'Oliveira, S. E. El Rouayheb, Daniel Heinlein, D. Karpuk
2021IEEE Journal on Selected Areas in Information Theory4 citations Open access
Semantic Scholar
Binary Subspace Codes in Small Ambient Spaces
Daniel Heinlein, Sascha Kurz
2018Advances in Mathematics of Communications4 citations Open access
Semantic Scholar
Algorithms and complexity for counting configurations in Steiner triple systems
Daniel Heinlein, P. Östergård
2021Journal of combinatorial designs (Print)3 citations Open access
Semantic Scholar
New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions
Daniel Heinlein
2019IEEE Transactions on Information Theory3 citations
Semantic Scholar
SPIRe: Boosting LLM Inference Throughput with Speculative Decoding
S. Neelam, Daniel Heinlein, Vaclav Cvicek, Akshay Mishra +1 more
2025arXiv.org2 citations
Semantic Scholar
On projective $q^r$-divisible codes
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
20192 citations
Semantic Scholar
Upper bounds for partial spreads from divisible codes
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
20172 citations
Semantic Scholar
Constructing Random Steiner Triple Systems: An Experimental Study
Daniel Heinlein, Patric R. J. Ostergaard
20221 citations
Semantic Scholar
Integer linear programming techniques for constant dimension codes and related structures
Daniel Heinlein
20181 citations
Semantic Scholar
New and updated semidefinite programming bounds for subspace codes
Daniel Heinlein, F. Ihringer
2018Advances in Mathematics of Communications1 citations Open access
Semantic Scholar
Aspects of Methods for Constructing Random Steiner Triple Systems
Daniel Heinlein, P. Östergård
20220 citations
Semantic Scholar
(Multi-)Sets of subspaces and divisible codes
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
20180 citations
Semantic Scholar
Upper bounds for constant dimension codes
Sascha Kurz, Daniel Heinlein, T. Honold, Michael Kiermaier +1 more
20170 citations
Semantic Scholar
The linear programming method for partial spreads
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
20170 citations
Semantic Scholar
Exact sign computations over the real algebraic numbers
Daniel Heinlein
20160 citations
Semantic Scholar
Tables for Sizes of largest known Codes in Network Coding
Daniel Heinlein
20150 citations
Semantic Scholar
Towards a classification of special partial spreads and subspace codes
Daniel Heinlein, T. Honold, Michael Kiermaier, Sascha Kurz +1 more
20150 citations
Semantic Scholar