Explicit Construction of Optimal Locally Recoverable Codes of Distance 5 and 6 via Binary Constant Weight Codes
Work
Year: 2019
Type: article
Abstract: In a paper by Guruswami et al., it was shown that the length n of a q-ary linear locally recoverable code with distance d ≥ 5 is upper bounded by O(dq <sup xmlns:mml="http://www.w3.org/1998/Math/MathM... more
Author Lingfei Jin
Cites: 29
Cited by: 72
Related to: 10
FWCI: 7.206
Citation percentile (by year/subfield): 100
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Grant IDS 11871154,