Tingting Chen
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
Research Subjects
Tingting Chen has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Xiande Zhang
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
9 shared publications - Gennian Ge
Capital Normal University
3 shared publications - Zhiwen He
South China Normal University, Guangzhou, China
3 shared publications - Wenjie Zhong
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
2 shared publications - Yanzhi Li
School of Mathematical Sciences, University of Science and Technology of China, Hefei, China
2 shared publications Yiming Ma
School of Cyber Security, University of Science and Technology of China, Hefei, China
2 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 584-594
DdlRT: A deterministic data layout for efficient redundancy transitioning in erasure-coded systems
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 584-594
Open AccessDdlRT: A deterministic data layout for efficient redundancy transitioning in erasure-coded systems
- 5 January 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 21
Improved bounds for codes over trees
- 5 January 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (1) , 21
Improved bounds for codes over trees
- Open Access
Improved Bounds for Codes over Trees
Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with pairwise distance at least $d$, denoted by $A(n,d)$, where the distance between any two labelled trees is the minimum number of edit edge operations in order to transform one tree to another. By various tools from graph theory and algebra, we show that when $n$ is large, $A(n,d)=O((Cn)^{n-d})$ for any $d\leq n-2$, and $A(n,d)=Ω((cn)^{n-d})$ for any $d$ linear with $n$, where constants $c\in(0,1)$ and $C\in [1/2,1)$ depending on $d$. Previously, only $A(n,d)=O(n^{n-d-1})$ for fixed $d$ and $A(n,d)=Ω(n^{n-2d})$ for $d\leq n/2$ were known, while the upper bound is improved for any $d$ and the lower bound is improved for $d\geq 2\sqrt{n}$. Further, for any fixed integer $k$, we prove the existence of codes of size $Ω(n^k)$ when $n-d=o(n)$, and give explicit constructions of codes which show $A(n,n-4)=Ω(n^2)$ and $A(n,n-13)=Ω(n^3)$.Open AccessImproved Bounds for Codes over Trees
Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with pairwise distance at least $d$, denoted by $A(n,d)$, where the distance between any two labelled trees is the minimum number of edit edge operations in order to transform one tree to another. By various tools from graph theory and algebra, we show that when $n$ is large, $A(n,d)=O((Cn)^{n-d})$ for any $d\leq n-2$, and $A(n,d)=Ω((cn)^{n-d})$ for any $d$ linear with $n$, where constants $c\in(0,1)$ and $C\in [1/2,1)$ depending on $d$. Previously, only $A(n,d)=O(n^{n-d-1})$ for fixed $d$ and $A(n,d)=Ω(n^{n-2d})$ for $d\leq n/2$ were known, while the upper bound is improved for any $d$ and the lower bound is improved for $d\geq 2\sqrt{n}$. Further, for any fixed integer $k$, we prove the existence of codes of size $Ω(n^k)$ when $n-d=o(n)$, and give explicit constructions of codes which show $A(n,n-4)=Ω(n^2)$ and $A(n,n-13)=Ω(n^3)$. - 10 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 4928-4945
Constant L₁-Weight Codes Under L∞-Metric
This paper studies the construction of constant L 1 -weight codes under L ∞ -metric, which could be used to design codes addressing 0-indels (i.e., the insertion/deletion of 0’s only). Based on the patterns of small codes, we determine the maximum size for codes with distance 2 and length 3 for any constant weight, and several constructions and algorithms for suboptimal codes with general length w +1 are also provided. In general, for codes with distance D , length w +1, and weight tD + r , we derive the size of the largest code by using Hall’s theorem for integers r = 0, t ∈ [0, 3] and w ≥ t -1. When r = D /2 with D being even, codes with a cardinality that surpasses the known existing sizes by the additive term ⌈1/3 ( t+1 2 )⌉ ⌊ w +1/3⌋ are constructed based on the structure of group divisible designs in combinatorics.
- 10 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (7) , 4928-4945
Constant L₁-Weight Codes Under L∞-Metric
This paper studies the construction of constant L 1 -weight codes under L ∞ -metric, which could be used to design codes addressing 0-indels (i.e., the insertion/deletion of 0’s only). Based on the patterns of small codes, we determine the maximum size for codes with distance 2 and length 3 for any constant weight, and several constructions and algorithms for suboptimal codes with general length w +1 are also provided. In general, for codes with distance D , length w +1, and weight tD + r , we derive the size of the largest code by using Hall’s theorem for integers r = 0, t ∈ [0, 3] and w ≥ t -1. When r = D /2 with D being even, codes with a cardinality that surpasses the known existing sizes by the additive term ⌈1/3 ( t+1 2 )⌉ ⌊ w +1/3⌋ are constructed based on the structure of group divisible designs in combinatorics.
- 10 April 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (8) , 2323-2340
New constructions of signed difference sets
- 10 April 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (8) , 2323-2340
New constructions of signed difference sets
- Open Access
New constructions of signed difference sets
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,λ)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions $xy^{-1}$ for all distinct two elements $x,y\in D$, represent each non-identity element in $G$ exactly $λ$ times. A $(v,k,λ)$-signed difference set is a generalization of a $(v,k,λ)$-difference set $D$, which satisfies all properties of $D$, but has a sign for each element in $D$. We will show some new existence results for signed difference sets by using partial difference sets, product methods, and cyclotomic classes.Open AccessNew constructions of signed difference sets
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,λ)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions $xy^{-1}$ for all distinct two elements $x,y\in D$, represent each non-identity element in $G$ exactly $λ$ times. A $(v,k,λ)$-signed difference set is a generalization of a $(v,k,λ)$-difference set $D$, which satisfies all properties of $D$, but has a sign for each element in $D$. We will show some new existence results for signed difference sets by using partial difference sets, product methods, and cyclotomic classes. - 25 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (8) , 5112-5125
Sparse and Balanced MDS Codes Over Small Fields
Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes over large fields. In this paper, we focus on small fields. We prove that there exists an $[n,k]_{q}$ MDS code that has a sparse and balanced generator matrix for any $q\geq n-1$ provided that $n\leq 2k$ , by designing several algorithms with complexity running in polynomial time in $k$ and $n$ . For the case $n>2k$ , we give some constructions for $q=n=p^{s}$ and $k=p^{e}m$ based on sumsets, when $e\leq s-2$ and $m\leq p-1$ , or $e=s-1$ and $m < \frac {p}{2}$ .
- 25 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (8) , 5112-5125
Sparse and Balanced MDS Codes Over Small Fields
Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes over large fields. In this paper, we focus on small fields. We prove that there exists an $[n,k]_{q}$ MDS code that has a sparse and balanced generator matrix for any $q\geq n-1$ provided that $n\leq 2k$ , by designing several algorithms with complexity running in polynomial time in $k$ and $n$ . For the case $n>2k$ , we give some constructions for $q=n=p^{s}$ and $k=p^{e}m$ based on sumsets, when $e\leq s-2$ and $m\leq p-1$ , or $e=s-1$ and $m < \frac {p}{2}$ .
- 18 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (11) , 7221-7231
Optimal Ternary Codes With Weight w and Distance 2w - 2 in ℓ1-Metric
The study of constant-weight codes in $\ell _{1}$ -metric was motivated by the duplication-correcting problem for data storage in live DNA. It is interesting to determine the maximum size of a code given the length ${n}$ , weight ${w}$ , minimum distance ${d}$ and the alphabet size ${q}$ . In this paper, based on graph decompositions, we determine the maximum size of ternary codes with constant weight w and distance $2{w}-2$ for all sufficiently large length ${n}$ . Previously, this was known only for a very sparse family ${n}$ of density $4/{w}({w}-1)$ .
- 18 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (11) , 7221-7231
Optimal Ternary Codes With Weight w and Distance 2w - 2 in ℓ1-Metric
The study of constant-weight codes in $\ell _{1}$ -metric was motivated by the duplication-correcting problem for data storage in live DNA. It is interesting to determine the maximum size of a code given the length ${n}$ , weight ${w}$ , minimum distance ${d}$ and the alphabet size ${q}$ . In this paper, based on graph decompositions, we determine the maximum size of ternary codes with constant weight w and distance $2{w}-2$ for all sufficiently large length ${n}$ . Previously, this was known only for a very sparse family ${n}$ of density $4/{w}({w}-1)$ .
- 18 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (7) , 4239-4254
Optimal Codes With Small Constant Weight in ℓ₁-Metric
Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in l 1 -metric. By using packings and group divisible designs in combinatorial design theory, we give constructions of optimal codes over non-negative integers and optimal ternary codes with l 1 -weight w ≤ 4 for all possible distances. In general, we derive the size of the largest ternary code with constant weight w and distance 2w-2 for sufficiently large length n satisfying n ≡ 1, w,- w+2,-2w+3 mod w(w-1).
- 18 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 67 (7) , 4239-4254
Optimal Codes With Small Constant Weight in ℓ₁-Metric
Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in l 1 -metric. By using packings and group divisible designs in combinatorial design theory, we give constructions of optimal codes over non-negative integers and optimal ternary codes with l 1 -weight w ≤ 4 for all possible distances. In general, we derive the size of the largest ternary code with constant weight w and distance 2w-2 for sufficiently large length n satisfying n ≡ 1, w,- w+2,-2w+3 mod w(w-1).
- Open Access
Sparse and Balanced MDS Codes over Small Fields
Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes over large fields. In this paper, we focus on small fields. We prove that there exists an $[n,k]_q$ MDS code that has a sparse and balanced generator matrix for any $q\geq n$ provided that $n\leq 2k$, by designing several algorithms with complexity running in polynomial time in $k$ and $n$.Open AccessSparse and Balanced MDS Codes over Small Fields
Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes over large fields. In this paper, we focus on small fields. We prove that there exists an $[n,k]_q$ MDS code that has a sparse and balanced generator matrix for any $q\geq n$ provided that $n\leq 2k$, by designing several algorithms with complexity running in polynomial time in $k$ and $n$.