arXiv (All)
open access
The Reach of Abelian Covers in Hypergraphs
Covers in hypergraphs are frequently studied to capture various forms of dependence between hyperedges. For example, even covers--which check if each vertex appears in an even number of hyperedges--have found much success recently in the study of locally decodable codes. Inspired by a recently-emerg
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
- Cyclic $$(r,\delta )$$ locally recoverable codes from their constacyclic and negacyclic subcodes#130691
- Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size#971974
- Asymptotic and finite-length optimization of LDPC codes#401929
- C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression#282898
- Decoupling is a Necessity: Transformation-Agnostic Decompiled Code Recovery under Optimization and Obfuscation#618638
Record · ID 1131962
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