Zitan Chen

Dr. Zitan Chen

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 September 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ZCZitan Chen
Zitan Chen
ABAlexander Barg
Alexander Barg
The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate freely without taxing the system bandwidth, and that the only information transmission that counts is the one between the racks. This assumption implies that the nodes within each of the racks can collaborate before providing information to the failed node. The main emphasis of the paper is on code construction for this storage model. We present an explicit family of maximum distance separable (MDS) array codes that support recovery of a single failed node from any number of helper racks using the minimum possible amount of inter-rack communication(such codes are said to provide optimal repair). The codes are constructed over finite fields of size comparable to the code length. We also derive a bound on the number of symbols accessed at helper nodes for the purposes of repair, and construct a code family that approaches this bound, while still maintaining the optimal repair property. Finally, we present a construction of scalar Reed-Solomon codes that support optimal repair for the rack-oriented storage model.

18 August 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ZCZitan Chen
Zitan Chen
MYMin Ye
Min Ye
ABAlexander Barg
Alexander Barg
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme that supports repair of failed nodes with optimal repair bandwidth. In this paper, we extend this result in two directions. First, we propose a new repair scheme for the RS codes constructed in [Tamo-Ye-Barg, IEEE Transactions on Information Theory, vol. 65, May 2019] and show that repair is robust to erroneous information provided by the helper nodes while maintaining the optimal repair bandwidth. Second, we construct a new family of RS codes with optimal access for the repair of any single failed node.We also show that the constructed codes can accommodate both features, supporting optimal-access repair with optimal error-correction capability. Going beyond RS codes, we also prove that any scalar MDS code with repair bandwidth attaining the cutset bound affords a repair scheme with optimal access property.

14 October 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ZCZitan Chen
Zitan Chen
ABAlexander Barg
Alexander Barg
Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic constructions of LRC codes and derive conditions on the zeros of the code that support the property of hierarchical locality. As a result, we obtain a general family of hierarchical LRC codes for a new range of code parameters. We also observe that our approach enables one to represent an LRC code in quasicyclic form, and use this representation to construct tail-biting convolutional LRC codes with locality. Among other results, we extend the general approach to cyclic codes with locality to multidimensional cyclic codes, yielding new families of LRC codes with availability, and construct a family of $q$ -ary cyclic hierarchical LRC codes of unbounded length.

5 April 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ZCZitan Chen
Zitan Chen
We construct a family of $(n,k)$ convolutional codes with degree $\delta \in \{k,n-k\}$ that have a maximum distance profile. The field size required for our construction is $\Theta (n^{2\delta })$ , which improves upon the known constructions of convolutional codes with a maximum distance profile. Our construction is based on the theory of skew polynomials.

26 December 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
ZCZitan Chen
Zitan Chen
Convolutional codes with a maximum distance profile attain the largest possible column distances for the maximum number of time instants and thus have outstanding error-correcting capability especially for streaming applications. Explicit constructions of such codes are scarce in the literature. In particular, known constructions of convolutional codes with rate $k/n$ and a maximum distance profile require a field of size at least exponential in $n$ for general code parameters. At the same time, the only known lower bound on the field size is the trivial bound that is linear in $n$ . In this paper, we show that a finite field of size $\Omega _{L}(n^{L-1})$ is necessary for constructing convolutional codes with rate $k/n$ and a maximum distance profile of length $L$ . As a direct consequence, this rules out the possibility of constructing convolutional codes with a maximum distance profile of length $L\geq 3$ over a finite field of size $O(n)$ . Additionally, we also present an explicit construction of convolutional code with rate $k/n$ and a maximum profile of length $L=1$ over a finite field of size $O(n^{\min \{k,n-k\}})$ , achieving a smaller field size than known constructions with the same profile length.

6 January 2025 in Entropy
Verified
Journal Article
Open access
PDF file
YYYANG YAOYU
YANG YAOYU
ZCZitan Chen
Zitan Chen
Motivated by studies of data retrieval in polymer-based storage systems, we consider the problem of reconstructing a multiset of binary strings that have the same length and the same weight from the compositions of their prefixes and suffixes of every possible length. We provide necessary and sufficient conditions for which unique reconstruction up to the reversal of the strings is possible. Additionally, we present two algorithms for reconstructing strings from the compositions of prefixes and suffixes of constant-length constant-weight strings.