An open problem and a conjecture on binary linear complementary pairs of codes
Abstract
The existence of $q$-ary linear complementary pairs (LCPs) of codes with $q> 2$ has been completely characterized so far. This paper gives a characterization for the existence of binary LCPs of codes. As a result, we solve an open problem proposed by Carlet $et~al.$ (IEEE Trans. Inf. Theory 65(3): 1694-1704, 2019) and a conjecture proposed by Choi $et~al.$ (Cryptogr. Commun. 15(2): 469-486, 2023).
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2023
- DOI:
- 10.48550/arXiv.2312.09482
- arXiv:
- arXiv:2312.09482
- Bibcode:
- 2023arXiv231209482L
- Keywords:
-
- Computer Science - Information Theory