Fengxing Zhu

collaborators

5 papers

cs.IT2025

Sequence Reconstruction over the Deletion Channel

Fengxing Zhu

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from ${0, 1}^{n}$ and the channel can delete up to…

math.CO2025

The Time of Bootstrap Percolation in High Dimensions

Fengxing Zhu

We consider the $d$ -neighbor bootstrap percolation process on the $d$ -dimensional torus, with vertex set $V = {1, \dots, n}^{d}$ and edge set $\{xy:\sum_{i=1}^d|x_i-y_i (\text{mod} \;…

math.CO2025

Bootstrap percolation on a generalized Hamming cube \MakeUppercase{\romannumeral 2}

Fengxing Zhu

In this paper we obtain the critical probability $p_{c} (Q_{k, n}, r)$ for bootstrap percolation with the infection threshold $r = \frac{N}{2}$ on the generalized $n$ -dimensional hypercub…

math.CO2025

Maximum Percolation Time on the q-ary Hypercube

Fengxing Zhu

We consider the $2$ -neighbor bootstrap percolation process on the $n$ -dimensional $q$ -ary hypercube with vertex set $V = {0, 1, \dots, q - 1}^{n}$ and edges connecting the pairs at Hammin…

math.CO2024

Bootstrap percolation on a generalized Hamming cube

Fengxing Zhu

We consider the $r$ -neighbor bootstrap percolation process on the graph with vertex set $V = {0, 1}^{n}$ and edges connecting the pairs at Hamming distance $1, 2, \dots, k$ , where $k\ge…