A class of locally recoverable codes over finite chain rings

January 10, 2024 Β· Declared Dead Β· πŸ› Designs, Codes and Cryptography

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

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Giulia Cavicchioni, Eleonora Guerrini, Alessio Meneghetti arXiv ID 2401.05286 Category cs.IT: Information Theory Cross-listed math.AC Citations 0 Venue Designs, Codes and Cryptography Last Checked 4 months ago
Abstract
Locally recoverable codes deal with the task of reconstructing a lost symbol by relying on a portion of the remaining coordinates smaller than an information set. We consider the case of codes over finite chain rings, generalizing known results and bounds for codes over fields. In particular, we propose a new family of locally recoverable codes by extending a construction proposed in 2014 by Tamo and Barg, and we discuss its optimality.
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