Locally recoverable codes from algebraic curves and surfaces
January 18, 2017 Β· Declared Dead Β· π arXiv.org
"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 Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Information Theory
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems
R.I.P.
π»
Ghosted
Towards Smart and Reconfigurable Environment: Intelligent Reflecting Surface Aided Wireless Network
π
π
The Cartographer
Wireless Communications with Unmanned Aerial Vehicles: Opportunities and Challenges
R.I.P.
π»
Ghosted
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
π
π
The Cartographer
An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted