The Star Product of Uniformly Random Codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914166503112704 |
|---|---|
| author | Dinesen, Johan V. Freij-Hollanti, Ragnar Hollanti, Camilla Jany, Benjamin Ravagnani, Alberto |
| author_facet | Dinesen, Johan V. Freij-Hollanti, Ragnar Hollanti, Camilla Jany, Benjamin Ravagnani, Alberto |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_17236 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Star Product of Uniformly Random Codes Dinesen, Johan V. Freij-Hollanti, Ragnar Hollanti, Camilla Jany, Benjamin Ravagnani, Alberto Information Theory 94B05 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. |
| title | The Star Product of Uniformly Random Codes |
| topic | Information Theory 94B05 |
| url | https://arxiv.org/abs/2511.17236 |