Reproduce “A new class of optimal binary linear complementary pairs of codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yansheng Wu, Jing Chen
The authors construct optimal binary linear complementary pairs (LCPs) from Belov codes with θ=4, extending their earlier θ=3 work. Additional column puncturing broadens the parameter range while the codes meet the Griesmer bound; a partner makes each pair complementary. At dimension k=6, θ=4 gives d≥41 and n≥84, versus θ=3’s d≥45 and n≥91. These are bounds at lengths and under construction conditions.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.