Binary LRCs are constructed via concatenation with F4 outer codes to achieve Griesmer-like and perfect optimality, plus an improved Johnson-like bound for r=2 with explicit attaining codes.
IEEE Transactions on Commu- nications70(5), 2895–2908 (2022)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constructions of locally repairable codes via concatenated codes
Binary LRCs are constructed via concatenation with F4 outer codes to achieve Griesmer-like and perfect optimality, plus an improved Johnson-like bound for r=2 with explicit attaining codes.