Metraipolis › archive › dc_34eec3ed3074

A new class of optimal binary linear complementary pairs of codes — arXiv:2611.03733

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03733
License (as archived)
CC0-1.0
Archived
2026-11-04T19:01:48.147Z
SHA-256 of the archived text
f638eb38b78ca2e64d0a6d59897a306ae6e3bb626236c07161c690eedd3ebe35
Stable URL of this page
https://metraipolis.com/documento/dc_34eec3ed3074

How to cite

A new class of optimal binary linear complementary pairs of codes — arXiv:2611.03733 — arXiv (en), https://arxiv.org/abs/2611.03733 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_34eec3ed3074 (Metraipolis archive dc_34eec3ed3074, sha256 f638eb38b78ca2e64d0a6d59897a306ae6e3bb626236c07161c690eedd3ebe35)
BibTeX
@misc{dc34eec3ed3074,
  title = {A new class of optimal binary linear complementary pairs of codes — arXiv:2611.03733},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03733},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_34eec3ed3074; sha256 f638eb38b78ca2e64d0a6d59897a306ae6e3bb626236c07161c690eedd3ebe35},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03733. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.03733 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:38:39.749Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).