Locally recoverable codes correcting many erasures over small fields

DOI10.1007/s10623-021-00905-4zbMath1476.11141OpenAlexW3177716776MaRDI QIDQ1981796

Edoardo Ballico

Publication date: 6 September 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-021-00905-4

zbMATH Keywords

MDSerasureslocally recoverable codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Higher Hamming weights for locally recoverable codes on algebraic curves
• The dual minimum distance of arbitrary-dimensional algebraic-geometric codes
• Blocking sets and partial spreads in finite projective spaces
• Anticode-based locally repairable codes with high availability
• Locally recoverable codes from algebraic curves and surfaces
• Evaluation codes from smooth quadric surfaces and twisted Segre varieties
• Open problems in finite projective spaces
• Locally Repairable Codes
• Explicit Maximally Recoverable Codes With Locality
• Algebraic Function Fields and Codes
• Fundamentals of Error-Correcting Codes
• The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
• Locally Recoverable Codes on Algebraic Curves
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locally recoverable codes correcting many erasures over small fields