Daniel Heinlein
Title
Cited by
Cited by
Year
Tables of subspace codes
D Heinlein, M Kiermaier, S Kurz, A Wassermann
arXiv preprint arXiv:1601.02864, 2016
46*2016
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
D Heinlein, S Kurz
International Castle Meeting on Coding Theory and Applications, 163-191, 2017
252017
Coset construction for subspace codes
D Heinlein, S Kurz
IEEE Transactions on Information Theory 63 (12), 7651-7660, 2017
222017
Projective divisible binary codes
D Heinlein, T Honold, M Kiermaier, S Kurz, A Wassermann
arXiv preprint arXiv:1703.08291, 2017
172017
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
D Heinlein, T Honold, M Kiermaier, S Kurz, A Wassermann
Designs, Codes and Cryptography 87 (2), 375-391, 2019
162019
An upper bound for binary subspace codes of length 8, constant dimension 4 and minimum distance 6
D Heinlein, S Kurz
92017
A subspace code of size in the setting of a binary -analog of the Fano plane
D Heinlein, M Kiermaier, S Kurz, A Wassermann
arXiv preprint arXiv:1708.06224, 2017
92017
Degree tables for secure distributed matrix multiplication
GLR D’Oliveira, S El Rouayheb, D Heinlein, D Karpuk
2019 IEEE Information Theory Workshop (ITW), 1-5, 2019
82019
New LMRD code bounds for constant dimension codes and improved constructions
D Heinlein
IEEE Transactions on Information Theory 65 (8), 4822-4830, 2019
72019
Tables of subspace codes (2016)
D Heinlein, M Kiermaier, S Kurz, A Wassermann
arXiv preprint arXiv:1601.02864, 0
6
Binary subspace codes in small ambient spaces
D Heinlein, S Kurz
arXiv preprint arXiv:1804.02219, 2018
52018
Generalized vector space partitions
D Heinlein, T Honold, M Kiermaier, S Kurz
arXiv preprint arXiv:1803.10180, 2018
52018
A new upper bound for subspace codes
D Heinlein, S Kurz
arXiv preprint arXiv:1703.08712, 2017
52017
Generalized linkage construction for constant-dimension codes
D Heinlein
IEEE Transactions on Information Theory, 2020
42020
Notes on communication and computation in secure distributed matrix multiplication
RGL D’Oliveira, S El Rouayheb, D Heinlein, D Karpuk
2020 IEEE Conference on Communications and Network Security (CNS), 1-6, 2020
42020
New LMRD bounds for constant dimension codes and improved constructions
D Heinlein
arXiv preprint arXiv:1801.04803, 2018
32018
Upper bounds for partial spreads from divisible codes
S Kurz, D Heinlein, M Kiermaier, A Wasserman, T Honold
Proc. The 13th International Conference on Finite Fields and their …, 2017
22017
On projective -divisible codes
D Heinlein, T Honold, M Kiermaier, S Kurz, A Wassermann
arXiv preprint arXiv:1912.10147, 2019
12019
Integer linear programming techniques for constant dimension codes and related structures
D Heinlein
12018
Classification of optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
D Heinlein, T Honold, M Kiermaier, S Kurz, A Wassermann
12017
The system can't perform the operation now. Try again later.
Articles 1–20