arXiv (All)
open access
Explicit construction of optimal binary linear complementary pairs via Belov codes
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 opti
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
- Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach#1389166
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
- Distinguishers for Skew and Linearized Reed-Solomon Codes#13008
- On the structure of polynomial ideal codes and additive Reed--Solomon codes#1356845
- Lower Bounds for all List-Decodable Deletion Codes#1062537
Record · ID 1388585
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