YZYaqian Zhang

Yaqian Zhang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yaqian Zhang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Construction of Binary Cooperative MSR Codes with Multiple Repair Degrees

    by Lei Li, Xinchun Yu, Yaqian Zhang, Liang Chen, Yuanyuan Dong, Chenhao Ying, Yuan Luo

  • Open Access

    New Centralized MSR Codes With Small Sub-packetization

    by Yaqian Zhang

    Centralized repair refers to repairing $h\geq 2$ node failures using $d$ helper nodes in a centralized way, where the repair bandwidth is counted by the total amount of data downloaded from the helper nodes. A centralized MSR code is an MDS array code with $(h,d)$-optimal repair for some $h$ and $d$. In this paper, we present several classes of centralized MSR codes with small sub-packetization. At first, we construct an alternative MSR code with $(1,d_i)$-optimal repair for multiple repair degrees $d_i$ simultaneously. Based on the code structure, we are able to construct a centralized MSR code with $(h_i,d_i)$-optimal repair property for all possible $(h_i,d_i)$ with $h_i\mid (d_i-k)$ simultaneously. The sub-packetization is no more than ${\rm lcm}(1,2,\ldots,n-k)(n-k)^n$, which is much smaller than a previous work given by Ye and Barg ($({\rm lcm}(1,2,\ldots,n-k))^n$). Moreover, for general parameters $2\leq h\leq n-k$ and $k\leq d\leq n-h$, we further give a centralized MSR code enabling $(h,d)$-optimal repair with sub-packetization smaller than all previous works.

  • Cooperative Repair of Reed-Solomon Codes via Linearized Permutation Polynomials

    by Jingke Xu, Yaqian Zhang, Ke Wang, Zhifang Zhang

    In distributed storage, cooperative repair is to simultaneously recover $h$ ( $h>1$ ) node erasures by downloading data from surviving nodes as well as collaboration between the $h$ replacement nodes. In this work, we propose a generalized cooperative repair framework for Reed-Solomon (RS) codes with two erasures. The key idea is to construct parity-check polynomials for the two replacement nodes respectively and then reduce the repair problem to the design of a linearized permutation polynomial related to the parity-check polynomials. We provide constructions of the linearized permutation polynomial in several cases, leading to cooperative repair schemes accordingly. Compared with the schemes given by Dau et al. 2021, our schemes retain the same repair bandwidth while apply to a much wider parameter regime and need only one-round collaboration. Finally we further reduce the repair bandwidth by the lifting method for RS codes of short length.


  • Open Access

    Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage

    by Shu Liu, Chaoping Xing, Yaqian Zhang

    In DNA-based data storage, DNA codes with biochemical constraints and error correction are designed to protect data reliability. Single-stranded DNA sequences with secondary structure avoidance (SSA) help to avoid undesirable secondary structures which may cause chemical inactivity. Homopolymer run-length limit and GC-balanced limit also help to reduce the error probability of DNA sequences during synthesizing and sequencing. In this letter, based on a recent work \cite{bib7}, we construct DNA codes free of secondary structures of stem length $\geq m$ and have homopolymer run-length $\leq\ell$ for odd $m\leq11$ and $\ell\geq3$ with rate $1+\log_2ρ_m-3/(2^{\ell-1}+\ell+1)$, where $ρ_m$ is in Table \ref{tm}. In particular, when $m=3$, $\ell=4$, its rate tends to 1.3206 bits/nt, beating a previous work by Benerjee {\it et al.}. We also construct DNA codes with all of the above three constraints as well as single error correction. At last, codes with GC-locally balanced constraint are presented.

  • Open Access

    Folded Polynomial Codes for Coded Distributed $AA^\top$-Type Matrix Multiplication

    by Jingke Xu, Yaqian Zhang, Libo Wang

    In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing $AA^\top$ in a distributed computing system with $N$ worker nodes and a master node, where the input matrices $A$ and $A^\top$ are partitioned into $m$-by-$p$ and $p$-by-$m$ blocks of equal-size sub-matrices respectively. For effective straggler mitigation, we propose a novel computation strategy, named \emph{folded polynomial code}, which is obtained by modifying the entangled polynomial codes. Moreover, we characterize a lower bound on the optimal recovery threshold among all linear computation strategies when the underlying field is the real number field, and our folded polynomial codes can achieve this bound in the case of $m=1$. Compared with all known computation strategies for coded distributed matrix multiplication, our folded polynomial codes outperform them in terms of recovery threshold, download cost, and decoding complexity.

  • Folded Polynomial Codes for Coded Distributed AA⊤-Type Matrix Multiplication

    by Jingke Xu, Yaqian Zhang, Libo Wang

    In this paper, due to the important value in practical applications, we consider the coded distributed matrix multiplication problem of computing AA ⊤ in a distributed computing system with N worker nodes and a master node, where the input matrices A and A ⊤ are partitioned into m -by- p and p -by- m blocks of equal-size sub-matrices respectively. For effective straggler mitigation, we propose a novel computation strategy, named folded polynomial code , which is obtained by modifying the entangled polynomial codes. Moreover, we characterize a lower bound on the optimal recovery threshold among all linear computation strategies when the underlying field is the real number field, and our folded polynomial codes can achieve this bound in the case of m = 1. Compared with all known computation strategies for coded distributed matrix multiplication, our folded polynomial codes outperform them in terms of recovery threshold, download cost, and decoding complexity.

  • Scalar MSCR Codes via the Product Matrix Construction

    by Yaqian Zhang, Zhifang Zhang

    An (n,k,d) cooperative regenerating code provides the optimal-bandwidth repair for any t (t>1) node failures in a cooperative way. In particular, an MSCR (minimum storage cooperative regenerating) code retains the same storage overhead as an (n,k) MDS code. Suppose each node stores α symbols which indicates the sub-packetization level of the code. A scalar MSCR code attains the minimum sub-packetization, i.e., α = d - k + t. By now, all existing constructions of scalar MSCR codes restrict to very special parameters, eg. d = k or k = 2, etc. In a recent work, Ye and Barg construct MSCR codes for all n, k, d, t, however, their construction needs α ≈ exp(nt) which is almost infeasible in practice. In this paper, we give an explicit construction of scalar MSCR codes for all d ≥ max{2k - 1 - t, k}, which covers all possible parameters except the case of k ≤ d ≤ 2k - 2 - t when k < 2k - 1 - t. Moreover, as a complementary result, for k < d < 2k - 2 - t we prove the nonexistence of linear scalar MSCR codes that have invariant repair spaces. Our construction and most of the previous scalar MSCR codes all have invariant repair spaces and this property is appealing in practice because of convenient repair. In this sense, this work presents an almost full description of usual scalar MSCR codes.