This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.

This paper develops a new decoding algorithm for Desarguesian spread codes to uniquely decode in the presence of insertions and deletions, even when the sum of their dimensions exceeds half the minimu…

This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.

The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.

This paper derives bounds on the probability of incorrect clustering of noisy short sequences using statistically optimal rules, focusing on DNA storage decoders.

The paper introduces SB-ECC, a novel score-based decoder that models error correction as continuous-time denoising, achieving state-of-the-art performance across various code families and noise levels…

This paper introduces skew CRT codes, a decoding algorithm, and the poly-skew metric for error modeling.

This paper introduces and studies the block tensor rank of sum-rank metric codes, showing its additive decomposition and deriving lower bounds.

The paper analyzes the security of the post-quantum signature scheme CROSS by showing that the underlying Restricted Syndrome Decoding problem can be reduced to both code-based and lattice-based probl…

This paper introduces a novel algorithm, CiSC, to efficiently and optimally synthesize circuit implementations of linear codes for hardware security, significantly outperforming existing state-of-the-…

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.