Divisible Codes
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914211195518976 |
|---|---|
| author | Kurz, Sascha |
| author_facet | Kurz, Sascha |
| contents | A linear code over $\mathbb{F}_q$ with the Hamming metric is called $Δ$-divisible if the weights of all codewords are divisible by $Δ$. They have been introduced by Harold Ward a few decades ago. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The determination of the possible lengths of projective divisible codes is an interesting and comprehensive challenge. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2112_11763 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Divisible Codes Kurz, Sascha Information Theory Combinatorics 94B05 (51E23) A linear code over $\mathbb{F}_q$ with the Hamming metric is called $Δ$-divisible if the weights of all codewords are divisible by $Δ$. They have been introduced by Harold Ward a few decades ago. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The determination of the possible lengths of projective divisible codes is an interesting and comprehensive challenge. |
| title | Divisible Codes |
| topic | Information Theory Combinatorics 94B05 (51E23) |
| url | https://arxiv.org/abs/2112.11763 |