We establish improved asymptotic rate bounds for adversarial insertion--deletion codes. For binary unique-deletion correction in the linear-deletion regime, we strictly improve Levenshtein's classical lower-bound expression. At deletion fraction $\delta=0.1$, our achievable rate increases from $0.162009$ to $0.194890$,...
Han Mao Kiah, Heng-Jia Wei, Rui-Xiao Zeng· 2 citations
We study codes correcting adversarial insertions and deletions with list size $L$ fixed independently of the block length. We derive new achievable-rate bounds for binary codes and upper bounds over every fixed alphabet of size $q\ge2$, retaining explicit dependence on $L$. We establish a combinatorial reduction that t...
Han Mao Kiah, Heng-Jia Wei, Rui-Xiao Zeng· 2 citations
A new modification of the ramp secret sharing scheme, called compact sharing, is introduced, and the MPC protocol is tailored to accommodate this modification, which provides perfect security against static semi-honest adversaries under an explicit tradeoff between the corruption threshold and the extension degree.
Wilton Kim, Van Long Phuoc Pham, Stanislav Kruglik et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
