跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.03733 · v1

A new class of optimal binary linear complementary pairs of codes

Yansheng WuJing Chen
cs.IT
首次提交 2026-11-01 23:54
版本更新 2026-11-01 23:54
雷达观测 2026-11-04 23:43
arXiv ↗PDF ↗

摘要

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.

作者备注：31 pages, accepted by SETA 2026

查看 arXiv 原文 ↗阅读 PDF ↗

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存，登录后共享已有结果。

版本差异

目前只观测到一个版本，无法比较变化。之后收录新版本时，会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-01 23:54 · 最新观测版本

A new class of optimal binary linear complementary pairs of codes

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.

查看此版本解读 →查看此版本原文 ↗