2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.IT2026★ 2 cited
Improved Decoding of Tanner Codes
Zhaienhe Zhou, Zeyu Guo
In this paper, we present improved decoding algorithms for expander-based Tanner codes. We begin by developing a randomized linear-time decoding algorithm that, under the condition…
cs.CR2026
High-Rate Public-Key Pseudorandom Codes for Edit Errors
Shengtang Huang, Xin Li, Songtao Mao +1
Pseudorandom codes (PRCs), introduced by Christ and Gunn (CRYPTO '2024), are error-correcting codes whose codewords are computationally indistinguishable from uniformly random stri…
cs.CR2025
Algorithms for Sparse LPN and LSPN Against Low-noise
Xue Chen, Wenxuan Shu, Zhaienhe Zhou
We consider sparse variants of the classical Learning Parities with random Noise (LPN) problem. Our main contribution is a new algorithmic framework that provides learning algorith…