Johan V. Dinesen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Johan V. Dinesen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Alberto Ravagnani
Eindhoven University of Technology
1 shared publication - Benjamin Jany
Department of Mathematics and Computer Science Eindhoven University of Technology The Netherlands
1 shared publication - Camilla Hollanti
Department of Mathematics and Systems Analysis, Aalto University, Espoo, Finland
1 shared publication - Ragnar Freij-Hollanti
Department of Mathematics and Systems Analysis, Aalto University, Espoo, Finland
1 shared publication
Latest Publications
- Open Access
The Star Product of Uniformly Random Codes
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We achieve this by establishing a correspondence between the star product and the evaluation of bilinear forms, which we use to provide a lower bound on the expected star product dimension. We show that asymptotically in both the field size q and the dimensions of the two codes, the expected dimension reaches its maximum. Lastly, we discuss some implications related to private information retrieval, secure distributed matrix multiplication, quantum error correction, and the potential for exploiting the results in cryptanalysis.
Open AccessThe Star Product of Uniformly Random Codes
We consider the problem of determining the expected dimension of the star product of two uniformly random linear codes that are not necessarily of the same dimension. We achieve this by establishing a correspondence between the star product and the evaluation of bilinear forms, which we use to provide a lower bound on the expected star product dimension. We show that asymptotically in both the field size q and the dimensions of the two codes, the expected dimension reaches its maximum. Lastly, we discuss some implications related to private information retrieval, secure distributed matrix multiplication, quantum error correction, and the potential for exploiting the results in cryptanalysis.