arXiv (All)
open access
Two-Sided Product Expanding Codes via Rademacher Matrices
We give a proof of the existence of two-sided product expanding codes which, unlike the earlier result of Kalachev and Panteleev (FOCS, 2025), does not rely on explicit constructions of asymptotically optimal locally testable codes ($c^3$-LTCs). For every fixed number of component codes and dimensio
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
- Deterministic Distributed Linearly Separable Computation via Nested Cyclic Codes#1343700
- New Minimum Storage Regenerating Codes With Small Sub-packetization Levels for All Admissible Repair Degrees#1326579
- Explicit construction of optimal exact regenerating codes for distributed storage#328659
- Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation#973953
- Amortized Relaxed Locally Decodable Codes#1110696
Record · ID 1186826
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