| Autor: |
Ismael Gutierrez-Garcia, Ivan Molina Naizir |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
IEEE Access, Vol 8, Pp 51333-51339 (2020) |
| Druh dokumentu: |
article |
| ISSN: |
2169-3536 |
| DOI: |
10.1109/ACCESS.2020.2980670 |
| Popis: |
In general, the construction of subspace codes or, in particular, cyclic Grassmannian codes in some projective space Pq(n) is highly mathematical and requires substantial computational power for the resulting searches. In this paper, we present a new method for the construction of cyclic Grassmannian codes. To do that was designed and implemented a series of algorithms using the GAP System for Computational Discrete Algebra and Wolfram Mathematica software. We also present a classification of such codes in the space Pq(n), with n at most 9. The fundamental idea to construct and classify the cyclic Grassmannian codes is to endow the projective space Pq(n) with a graph structure and then find cliques. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
