arXiv (All)
open access
A Matroidal Framework for Random Access in Linear Codes
We study random access in linear codes when codeword symbols are sampled independently and uniformly with replacement. A code is recovery balanced if the expected number of samples required to recover a codeword coordinate is the same for every coordinate. We express the recovery expectations in ter
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 the equivalence between additive and linear codes#629940
- On the equivalence between additive and linear codes#628078
- Grammar-Constrained Decoding Can Jailbreak LLMs into Generating Malicious Code#271928
- Two Families of Linear Codes Containing Non-GRS MDS Codes#1342376
- Codependency For Dummies#1192201
Record · ID 1413061
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