arXiv (All)
open access
Constraint-Preserving Genetic Algorithms for Embedding Linear Codes into Self-Orthogonal Codes
In this paper, we aim to construct binary optimal self-orthogonal codes using shortest self-orthogonal embedding methods. For this purpose, we design a heuristic framework based on a genetic algorithm. We explore the search space of shortest self-orthogonal embeddings using a fitness function based
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On neighbor distances and symmetry in group codes#490081
- Embedding linear codes over Z4 into self-orthogonal codes#925178
- Embedding linear codes over Z4 into self-orthogonal codes#920943
- Shortest self-orthogonal embeddings of binary linear codes#925845
- Bounds on Codes Correcting Adjacent Transpositions#609817
Record · ID 822534
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive