Paperlane

no. 8 · Wednesday 4 November 2026

A new class of optimal binary linear complementary pairs of codes

Yansheng Wu and Jing Chen

math.IT · 31 pp

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 $θ=4$, extending our previous work on $θ=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.

comments
31 pages, accepted by SETA 2026
fields
Information Theory
pdf ↗ page arXiv:2611.03733 ↗