8 citations · 9 across the 6 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2022
Syndrome decoding meets multiple instances
Haoxuan Wu, Jincheng Zhuang
The NP-hard problem of decoding random linear codes is crucial to both coding theory and cryptography. In particular, this problem underpins the security of many code based post-qu…
cs.IT2013★ 1 cited
On Determining Deep Holes of Generalized Reed-Solomon Codes
Qi Cheng, Jiyou Li, Jincheng Zhuang
For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole…