Skip to content
DraconiticResearch
Search Sources API
188,932 studies31 sourcesUpdated 49 min ago
PreprintCC BY-NC-ND 4.0arXiv

A new class of optimal binary linear complementary pairs of codes

  • Yansheng Wu
  • Jing Chen
Open at sourcePDFDOICite

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.

Related

  1. Explicit construction of optimal binary linear complementary pairs via Belov codes
    Yansheng Wu, Jing Chen, Jong Yoon Hyun
    arXivPreprintCC BY-NC-SA 4.0Full textGeneral mathematicsarXiv
  2. Linear Complementary Pairs of MDS Codes from Elliptic Curves
    Adler Marques
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Optimal self-orthogonal binary linear codes
    Sascha Kurz
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Reed-Muller Codes are Optimal Binary Linear 3-Query LCCs
    Oliver Janzer, Peter Manohar
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Pairs of lattice complements with complementary homology
    Sara Faridi, Dharm Veer, Volkmar Welker
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{wu2026class,
  title = {{A new class of optimal binary linear complementary pairs of codes}},
  author = {Yansheng Wu and Jing Chen},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03733},
  eprint = {2611.03733},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03733},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - A new class of optimal binary linear complementary pairs of codes
AU  - Yansheng Wu
AU  - Jing Chen
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.03733
UR  - https://arxiv.org/abs/2611.03733
AB  - 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.
ER  -