Gives the first high-rate public-key PRC constructions for edit channels by reducing from Hamming-robust PRCs, achieving rates near 1 for large alphabets and near 1/2 for binary, plus Singleton-bound rates for polynomial alphabets.
arXiv preprint arXiv:2303.17370 , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
High-Rate Public-Key Pseudorandom Codes for Edit Errors
Gives the first high-rate public-key PRC constructions for edit channels by reducing from Hamming-robust PRCs, achieving rates near 1 for large alphabets and near 1/2 for binary, plus Singleton-bound rates for polynomial alphabets.