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.
2016 IEEE International Symposium on Information Theory (ISIT) , pages =
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
No citing papers match the current filters.