15 citations · 27 across the 9 of their papers we have counts for
7 papers · 1 filter
New constructions of -Ary 2-D Z-Complementary Array Pairs
Hui Zhang, Cuiling Fan, Sihem Mesnager
This paper is devoted to sequences and focuses on designing new two-dimensional (2-D) Z-complementary array pairs (ZCAPs) by exploring two promising approaches. A ZCAP is a pair of…
The minimum linear locality of linear codes
Pan Tan, Cuiling Fan, Cunsheng Ding +1
Locally recoverable codes (LRCs) were proposed for the recovery of data in distributed and cloud storage systems about nine years ago. A lot of progress on the study of LRCs has be…
Optimal Locally Repairable Codes: An Improved Bound and Constructions
Han Cai, Cuiling Fan, Ying Miao +2
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinat…
The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
Cuiling Fan
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences…
New Optimal Binary Sequences with Period via Interleaving Ding-Helleseth-Lam Sequences
Wei Su, Yang Yang, Cuiling Fan
Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an…
Optimal Locally Repairable Systematic Codes Based on Packings
Han Cai, Minquan Cheng, Cuiling Fan +1
Locally repairable codes are desirable for distributed storage systems to improve the repair efficiency. In this paper, we first build a bridge between locally repairable code and…