Metraipolis › archive › dc_8c8fed4ddb97

New binary optimal LCD codes using heuristic embedding — arXiv:2609.02096

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.02096
License (as archived)
CC0-1.0
Archived
2026-10-17T05:45:36.544Z
SHA-256 of the archived text
07710c9f191489bb0dfe5adb0ff6fa255ecc09b9cfec8ab33bfecc522f002bff
Stable URL of this page
https://metraipolis.com/documento/dc_8c8fed4ddb97

How to cite

New binary optimal LCD codes using heuristic embedding — arXiv:2609.02096 — arXiv (en), https://arxiv.org/abs/2609.02096 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8c8fed4ddb97 (Metraipolis archive dc_8c8fed4ddb97, sha256 07710c9f191489bb0dfe5adb0ff6fa255ecc09b9cfec8ab33bfecc522f002bff)
BibTeX
@misc{dc8c8fed4ddb97,
  title = {New binary optimal LCD codes using heuristic embedding — arXiv:2609.02096},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.02096},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8c8fed4ddb97; sha256 07710c9f191489bb0dfe5adb0ff6fa255ecc09b9cfec8ab33bfecc522f002bff},
  year = {2026}
}

Archived text

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

In this paper, we investigate the construction of binary optimal LCD codes through short LCD embeddings. For this purpose, we design heuristic frameworks based on a greedy algorithm. We explore the search spaces of LCD embeddings using the fact that an invertible matrix together with an arbitrary matrix yields an LCD embedding. We therefore use elementary row operations on the invertible block and single entry-flips on the arbitrary block as local moves in a greedy algorithm. Using this method, we have found $14$ optimal new LCD codes with dimensions 7 and 8 for lengths from 55 to 201.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.02096 — 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-10-17T05:17:18.090Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).