Asymptotically optimal cyclic subspace codes
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908447887327232 |
|---|---|
| author | Castello, Chiara Santonastaso, Paolo |
| author_facet | Castello, Chiara Santonastaso, Paolo |
| contents | Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing cyclic subspace codes with large cardinality and prescribed minimum distance. Using this new method, we provide new constructions of cyclic subspace codes in the Grassmannian $\mathcal{G}_q(n,k)$ of all $k$-dimensional $\mathbb{F}_q$-subspaces of an $n$-dimensional vector space over $\mathbb{F}_q$, when $k\mid n$ and $n/k$ is a composite number, with minimum distance $2k-2$ and large size. We prove that the resulting codes have sizes larger than those obtained from previously known constructions with the same parameters. Furthermore, we show that our constructions of cyclic subspace codes asymptotically reach the Johnson type bound II for infinite values of $n/k$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_09290 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Asymptotically optimal cyclic subspace codes Castello, Chiara Santonastaso, Paolo Information Theory Combinatorics 11T71, 11T99, 94B99 Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing cyclic subspace codes with large cardinality and prescribed minimum distance. Using this new method, we provide new constructions of cyclic subspace codes in the Grassmannian $\mathcal{G}_q(n,k)$ of all $k$-dimensional $\mathbb{F}_q$-subspaces of an $n$-dimensional vector space over $\mathbb{F}_q$, when $k\mid n$ and $n/k$ is a composite number, with minimum distance $2k-2$ and large size. We prove that the resulting codes have sizes larger than those obtained from previously known constructions with the same parameters. Furthermore, we show that our constructions of cyclic subspace codes asymptotically reach the Johnson type bound II for infinite values of $n/k$. |
| title | Asymptotically optimal cyclic subspace codes |
| topic | Information Theory Combinatorics 11T71, 11T99, 94B99 |
| url | https://arxiv.org/abs/2507.09290 |