Locally recoverable codes from algebraic curves and surfaces

January 18, 2017 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Alexander Barg, Kathryn Haymaker, Everett W. Howe, Gretchen L. Matthews, Anthony VΓ‘rilly-Alvarado arXiv ID 1701.05212 Category cs.IT: Information Theory Cross-listed math.AG Citations 61 Venue arXiv.org Last Checked 5 months ago
Abstract
A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vlăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted