Zihan Zhang

collaborators

5 papers

cs.IT2026

Algorithmic List Decoding of Reed-Solomon Codes up to Capacity

Joshua Brakensiek, Yeyuan Chen, Aaron Putterman +2

We give a deterministic polynomial-time list-decoding algorithm for Reed-Solomon codes over prime fields that approaches list-decoding capacity for every evaluation set and every c…

cs.DS2026

Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms

Arpon Basu, Joshua Brakensiek, Yeyuan Chen +3

We extend the recent work of Reis and Rothvoss on sparsifying sums of $ℓ_{1}$ norms to the more general task of sparsifying (Minkowski) sums of centrally symmetric, convex sets. A…

cs.IT2026

Bounds and Limitations on Codes Achieving List Recovery Capacity

Joshua Brakensiek, Yeyuan Chen, Aaron Putterman +1

In coding theory, list recoverability is a fundamental concept which robustly captures how ``spread-out'' codewords are in a code. More formally, given a code $C \subseteq Σ^{n}$ and…

math.NT2026

An Improvement of Konstantoulas' Density Constant

Huixi Li, Zihan Zhang

Let $A \subset N$ , and define its ordered representation function $r (n) = # {(a, b) \in A \times A : a + b = n} .$ The Erdos--Turan conjecture asserts that, if $r (n) > 0$ for all sufficiently…

math.NT2025

Cross representations of additive complements of $r$ -th powers

Yuchen Ding, Ben Krause, Csaba Sándor +2

Let $N$ be the set of natural numbers and $S_{r} = {1^{r}, 2^{r}, 3^{r}, \dots}$ the set of $r$ -th powers, where $r \geq 2$ is a natural number. Let $\mathcal{W}_r…

Algorithmic List Decoding of Reed-Solomon Codes up to Capacity

Optimal Sparsifiers for Minkowski Sums and Sums of Seminorms

Bounds and Limitations on Codes Achieving List Recovery Capacity

An Improvement of Konstantoulas' Density Constant

Cross representations of additive complements of r-th powers

Cross representations of additive complements of $r$ -th powers