Linear Complementary Equi-Dual Codes
<|reference_start|>Linear Complementary Equi-Dual Codes: 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.<|reference_end|>
@article{nikseresht2024linear,
    title={Linear Complementary Equi-Dual Codes},
    author={Ashkan Nikseresht, Shohreh Namazi and Marziyeh Beygi Khormaei},
    journal={arXiv preprint arXiv:2408.05509},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.05509},
    primaryClass={cs.IT math.IT}
}