Multilevel constructions of constant dimension codes based on one-factorization of complete graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914126605844480 |
|---|---|
| author | Xu, Dengming LI, Mengmeng |
| author_facet | Xu, Dengming LI, Mengmeng |
| contents | Constant dimension codes (CDCs) have become an important object in coding theory due to their application in random network coding. The multilevel construction is one of the most effective ways to construct constant dimension codes. The paper is devoted to constructing CDCs by the multilevel construction. Precisely, we first choose an appropriate skeleton code based on the transformations of binary vectors related to the one-factorization of complete graphs; then we construct CDCs by using the chosen skeleton code, where quasi-pending blocks are used; finally, we calculate the dimensions by use of known constructions of optimal Ferrers diagram rank metric codes. As applications, we improve the lower bounds of $\overline{A}_q(n,8,6)$ for $16\leq n\leq 19.$ |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_27071 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multilevel constructions of constant dimension codes based on one-factorization of complete graphs Xu, Dengming LI, Mengmeng Information Theory Constant dimension codes (CDCs) have become an important object in coding theory due to their application in random network coding. The multilevel construction is one of the most effective ways to construct constant dimension codes. The paper is devoted to constructing CDCs by the multilevel construction. Precisely, we first choose an appropriate skeleton code based on the transformations of binary vectors related to the one-factorization of complete graphs; then we construct CDCs by using the chosen skeleton code, where quasi-pending blocks are used; finally, we calculate the dimensions by use of known constructions of optimal Ferrers diagram rank metric codes. As applications, we improve the lower bounds of $\overline{A}_q(n,8,6)$ for $16\leq n\leq 19.$ |
| title | Multilevel constructions of constant dimension codes based on one-factorization of complete graphs |
| topic | Information Theory |
| url | https://arxiv.org/abs/2510.27071 |