{
  "abstract": "The study of linear complementary pairs (LCPs) has been a hot topic in coding theory. Recently, Güneri constructed an infinite family of optimal binary LCPs from Solomon-Stiffler codes. Specifically, he proved that for every $k \\geq 5$ and $d \\geq \\lceil (k - 1)/2 \\rceil 2^{k - 1}$, there exist optimal binary linear complementary pairs of codes of length $g_2(k,d)$, where $g_2(k,d)$ denotes the Griesmer bound. In this paper, we construct additional optimal binary LCPs from Belov codes, which form a generalized class of Solomon-Stiffler codes. Our results not only generalize Güneri's construction, but also enable more flexible construction of optimal binary LCPs with a wide range of minimum distances.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.24019",
  "author_total": 3,
  "authors": [
    {
      "name": "Yansheng Wu"
    },
    {
      "name": "Jing Chen"
    },
    {
      "name": "Jong Yoon Hyun"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8jv2aan1r4mg1.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.24019",
  "fulltext_url": null,
  "id": "8jv2aan1r4mg1",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.24019",
  "language": null,
  "licence": "CC-BY-NC-SA-4.0",
  "licence_label": "CC BY-NC-SA 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1702|Coding theory and cryptography"
    ]
  ],
  "openalex": "W7223028061",
  "pdf_url": "https://arxiv.org/pdf/2610.24019",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-16",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8jv2aan1r4mg1.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:30:57Z",
      "native_id": "2610.24019",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.24019"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Explicit construction of optimal binary linear complementary pairs via Belov codes",
  "title_text": "Explicit construction of optimal binary linear complementary pairs via Belov codes",
  "type": "preprint",
  "updated_at": "2026-10-30T12:33:44Z",
  "url": "https://research.draconitic.com/paper/8jv2aan1r4mg1",
  "venue": "arXiv",
  "versions": []
}