Daniel Heinlein

Orcid: 0000-0002-3429-3572

Affiliations:
  • Aalto University, School of Electrical Engineering, Finland


According to our database1, Daniel Heinlein authored at least 14 papers between 2016 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Generalized Linkage Construction for Constant-Dimension Codes.
IEEE Trans. Inf. Theory, 2021

Degree Tables for Secure Distributed Matrix Multiplication.
IEEE J. Sel. Areas Inf. Theory, 2021

Field Trace Polynomial Codes for Secure Distributed Matrix Multiplication.
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

2020
New and updated semidefinite programming bounds for subspace codes.
Adv. Math. Commun., 2020

Notes on Communication and Computation in Secure Distributed Matrix Multiplication.
Proceedings of the 8th IEEE Conference on Communications and Network Security, 2020

2019
New LMRD Code Bounds for Constant Dimension Codes and Improved Constructions.
IEEE Trans. Inf. Theory, 2019

Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Des. Codes Cryptogr., 2019

A subspace code of size 333 in the setting of a binary q-analog of the Fano plane.
Adv. Math. Commun., 2019

Generalized vector space partitions.
Australas. J Comb., 2019

2018
New LMRD bounds for constant dimension codes and improved constructions.
CoRR, 2018

Binary subspace codes in small ambient spaces.
Adv. Math. Commun., 2018

2017
Coset Construction for Subspace Codes.
IEEE Trans. Inf. Theory, 2017

Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
Tables of subspace codes.
CoRR, 2016


  Loading...