Jing Jiang

Jing Jiang

Auto-generated profile, based on publicly available information

Jing Jiang

Guangxi Key Lab of Multi-source Information Mining & Security, Guangxi Normal University, Guilin 541004, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
25 February 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MCMinquan Cheng
Minquan Cheng
JJJing Jiang
Jing Jiang
QYQIFA YAN
QIFA YAN
XTXiaohu Tang
Xiaohu Tang
Coded caching scheme recently has become quite popular in the wireless network since the maximum transmission amount R reduces effectively during the peak-traffic times. To realize a coded caching scheme, each file must be divided into F packets which usually increases the computation complexity of a coded caching scheme. So we prefer to design a scheme with R and F as small as possible in practice. However there exists a tradeoff between R and F. In this paper, we generalize the schemes constructed by Shangguan et al. (IEEE Trans. Inf. Theory, 64, 5755-5766, 2018) and Yan et al. (IEEE Trans. Inf. Theory 63, 5821-5833, 2017) respectively. These two classes of schemes have a wider range of application due to the more flexible memory size than the original ones. By comparing with the previous known deterministic schemes, our new schemes have advantages on R or F.

24 December 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MCMinquan Cheng
Minquan Cheng
JJJing Jiang
Jing Jiang
XTXiaohu Tang
Xiaohu Tang
QYQIFA YAN
QIFA YAN
In coded caching system, we prefer to design a scheme with the rate R and the packet number F of each file split as small as possible since the efficiency of transmission in the peak traffic times increases with the decreasing of R and the realizing complexity increases with the increasing of F. Up to now, almost all of the previously known schemes can be realized by the combinatorial structure which is called placement delivery array (PDA). In this paper, we also study the schemes by means of PDAs. We first show that given the minimum rate, the scheme proposed by Maddah-Ali and Niesen (MN scheme) has the minimum packet number which is too large in practice. From the view point of combinatorial design, two variant MN schemes, which can significantly reduce the packet number by increasing some rate, are obtained. Especially one of these schemes has better performance than the scheme generated by the well known grouping method.

16 March 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
XZXi Zhong
Xi Zhong
MCMinquan Cheng
Minquan Cheng
JJJing Jiang
Jing Jiang
In the coded caching problem apart from transmission rate, reducing the number of packets F ia also meaningful for practical implementation for coded caching scheme. Yan et al. reformulate the centralized coded caching schemes as designing a corresponding placement delivery array (PDA). In this letter, we propose two concatenating constructions by concatenating some known PDAs to obtain new PDAs therefore new code caching schemes with low sub-packetization level. Further, the comparison and analysis of parameters between our new schemes and known schemes is also performed.

10 December 2020 in IEEE Access
Verified
Journal Article
Open access
JJJing Jiang
Jing Jiang
LQLingxiao Qu
Lingxiao Qu
Li et al. introduced coded distributed computing (CDC) scheme to reduce the communication load in general distributed computing frameworks such as MapReduce. They also proposed cascaded CDC schemes where each output function is computed multiple times, and proved that such schemes achieved the fundamental trade-off between computation load and communication load. However, these schemes require exponentially large numbers of input files and output functions when the number of computing nodes gets large. In this paper, by using the structure of placement delivery arrays (PDAs), we construct several infinite classes of cascaded CDC schemes. We also show that the numbers of output functions in all the new schemes are only a factor of the number of computing nodes, and the number of input files in our new schemes is much smaller than that of input files in CDC schemes derived by Li et al.

5 March 2015 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
JJJing Jiang
Jing Jiang
MCMinquan Cheng
Minquan Cheng
YMYing Miao
Ying Miao

27 June 2013 in Designs, Codes and Cryptography
Verified
Journal Article
Open access
PDF file
MCMinquan Cheng
Minquan Cheng
HFHung-Lin Fu
Hung-Lin Fu
JJJing Jiang
Jing Jiang
YLYuan-Hsun Lo
Yuan-Hsun Lo
YMYing Miao
Ying Miao
Let \(\mathbb{C }\) be a code of length \(n\) over an alphabet of \(q\) letters. The descendant code \(\mathsf{desc}(\mathbb C _0)\) of \(\mathbb C _0 = \{\mathbf{c}^1, \mathbf{c}^2, \ldots , \mathbf{c}^t\} \subseteq \mathbb{C }\) is defined to be the set of words \(\mathbf{x} = (x_1, x_2, \ldots ,x_n)\) such that \(x_i \in \{c^1_i, c^2_i, \ldots , c^t_i\}\) for all \(i=1, \ldots , n\). \(\mathbb{C }\) is a \(\overline{t}\)-separable code if for any two distinct \(\mathbb{C }_1, \mathbb{C }_2 \subseteq \mathbb{C }\) such that \(|\mathbb{C }_1| \le t\), \(|\mathbb{C }_2| \le t\), we always have \(\mathsf{desc}(\mathbb{C }_1) \ne \mathsf{desc}(\mathbb{C }_2)\). The study of separable codes is motivated by questions about multimedia fingerprinting for protecting copyrighted multimedia data. Let \(M(\overline{t},n,q)\) be the maximal possible size of such a separable code. In this paper, we provide an improved upper bound for \(M(\overline{2},2,q)\) by a graph theoretical approach, and a new lower bound for \(M(\overline{2},2,q)\) by deleting suitable points and lines from a projective plane, which coincides with the improved upper bound in some places. This corresponds to the bounds of maximum size of bipartite graphs with girth \(6\) and a construction of such maximal bipartite graphs.