An algorithm computes concise recovery structures for arbitrary linear codes, also yielding locality and dual distance.
Database for optimal parameters of ( t, m, s)-nets, ( t, s)-sequences, orthogonal arrays, linear codes and OOAs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing sharp recovery structures for Locally Recoverable codes
An algorithm computes concise recovery structures for arbitrary linear codes, also yielding locality and dual distance.