arXiv (All)
open access
Binary Cyclic Gradient Coding: Exact Recovery and Robustness to Compression
We introduce binary cyclic gradient coding (BCGC), an exact gradient coding scheme for $n$ workers and up to $s$ stragglers. Its encoding matrix is binary, circulant when $(s+1)\mid n$ and nearly circulant otherwise, and the master decodes by a single summation. Like the fractional repetition coding
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
- Improved lower bounds for decomposable randomized encoding#1011729
- Improved lower bounds for decomposable randomized encoding#965355
- Bitplanes Block Based Lossy Image Compression#114126
- RObust Header Compression (ROHC): Terminology and Channel Mapping Examples#141950
- Collaborative Decoding of Simultaneous Rational Evaluation Codes beyond the Unique Correction Capability#685052
Record · ID 1355023
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