Linear Complementary Equi-Dual Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916352832307200 |
|---|---|
| author | Nikseresht, Ashkan Namazi, Shohreh Khormaei, Marziyeh Beygi |
| author_facet | Nikseresht, Ashkan Namazi, Shohreh Khormaei, Marziyeh Beygi |
| contents | We call a linear code $C$ with length $n$ over a field $F$, a linear complementary equi-dual code, when there exists a linear code $D$ over $F$ such that $D$ is permutation equivalent to $C^\perp$ and $(C,D)$ is a linear complementary pair of codes, that is, $C+ D=F^n$ and $C\cap D=0$. We first state a necessary condition on a code $C$ to be linear complementary equi-dual. Then, we conjecture that this necessary condition is also sufficient and present several statements which support this conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_05509 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Linear Complementary Equi-Dual Codes Nikseresht, Ashkan Namazi, Shohreh Khormaei, Marziyeh Beygi Information Theory 94B05, 94B60, 94A60 We call a linear code $C$ with length $n$ over a field $F$, a linear complementary equi-dual code, when there exists a linear code $D$ over $F$ such that $D$ is permutation equivalent to $C^\perp$ and $(C,D)$ is a linear complementary pair of codes, that is, $C+ D=F^n$ and $C\cap D=0$. We first state a necessary condition on a code $C$ to be linear complementary equi-dual. Then, we conjecture that this necessary condition is also sufficient and present several statements which support this conjecture. |
| title | Linear Complementary Equi-Dual Codes |
| topic | Information Theory 94B05, 94B60, 94A60 |
| url | https://arxiv.org/abs/2408.05509 |