arXiv (All)
open access
Plotkin-type Bound on Function-Correcting Codes for Monomial Mappings
Function-correcting codes, recently introduced by Lenz et al.\ (2023), provide a framework for the receiver to provide a higher level of protection against channel errors than the level of protection for messages. In this paper, we derive a generalised Plotkin-type bound on the redundancy of FCCs un
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
- 17 U.S.C. § 111 — Limitations on exclusive rights: Secondary transmissions of broadcast programming by cable#573121
- Polar codes for channel and source coding#1361779
- The codebreakers#423432
- Compressed primitivity problem in free groups#1354200
- Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed-Solomon Codes#973490
Record · ID 1200197
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