arXiv (All)
open access
Generalized Function-Correcting Partition Codes: Bounds and constructions
We introduce generalized function-correcting partition codes (GFCPCs) that simultaneously protect multiple partitions of the message space against different numbers of errors. Given partitions with respective distance requirements, a GFCPC is a systematic encoding that guarantees, for each partition
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
- A Hyperbolic Bound for File Retrieval in DNA-Based Data Storage#1130909
- Genome misassembly detection using Stash: A data structure based on stochastic tile hashing#365156
- Optimal and minimal $p$-ary linear codes from generalized order ideals of hierarchical posets#1117840
- Unified Position-Invariant Random Access Through Two Compression Layers via Absolute-Offset Coordinates: A Bit-Perfect Device-Resident Proof#303177
- Security Implications of Predictable Fragment Identification Values#213421
Record · ID 1014687
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