Existence of Reed-Solomon codes robust to permutation plus n-2k+1 insertions and deletions implies fully anonymous (k-1,2k-1,n) ramp secret-sharing schemes.
On linear and cyclic codes for correcting deletions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions
Existence of Reed-Solomon codes robust to permutation plus n-2k+1 insertions and deletions implies fully anonymous (k-1,2k-1,n) ramp secret-sharing schemes.