arXiv:2611.03733v1 Announce Type: new Abstract: The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory. Based on the Belov codes, this paper proposes a novel construction of optimal binary LCPs with $\theta=4$, extending our previous work on $\theta=3$. Our results not only yield abundant new optimal binary LCPs with flexible parameters, but also enable more optimal binary LCPs with smaller minimum distances.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page