An algorithm computes concise recovery structures for arbitrary linear codes, also yielding locality and dual distance.
Massey, Minimal Codewords and Secret Sharing, in Proceed ings of the 6th Joint Swedish-Russian International Workshop on Information Theory, 1993, 276–279
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.