Publications (24)
Infinite families of -designs from a class of linear codes related to Dembowski-Ostrom functions
Rong Wang, Xiaoni Du, Cuiling Fan +1
Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial -designs have been attracted lots of research interest for decad…
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…
Infinite families of -designs from a class of cyclic codes with two non-zeros
Xiaoni Du, Rong Wang, Cuiling Fan
Combinatorial -designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed wei…
A class of optimal ternary cyclic codes and their duals
Cuiling Fan, Nian Li, Zhengchun Zhou
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decod…
Rank Distribution and Dynamics of Gram Matrices from Binary m-Sequences with Applications to LCD Codes
Hengfeng Liu, Chunming Tang, Cuiling Fan +1
The Gram matrix is a classical object formed from the pairwise inner products of a collection of vectors, with fundamental roles in functional analysis, statistics, combinatorics,…
New infinite families of p-ary weakly regular bent functions
Yanfeng Qi, Chunming Tang, Zhengchun Zhou +1
The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \cite{M2014}, Xu et…
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…
The Dimension and Minimum Distance of Two Classes of Primitive BCH Codes
Cunsheng Ding, Cuiling Fan, Zhengchun Zhou
Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes…
Two infinite classes of rotation symmetric bent functions with simple representation
Chunming Tang, Yanfeng Qi, Zhengchun Zhou +1
In the literature, few -variable rotation symmetric bent functions have been constructed. In this paper, we present two infinite classes of rotation symmetric bent functions on…
The Asymmetric Hamming Bidistance and Distributions over Binary Asymmetric Channels
Shukai Wang, Cuiling Fan, Chunming Tang +1
The binary asymmetric channel is a model for practical communication systems where the error probabilities for symbol transitions and differ substa…
Linear Codes with Two or Three Weights From Quadratic Bent Functions
Zhengchun Zhou, Nian Li, Cuiling Fan +1
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of -ar…
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 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…
Capacity-Achieving Codes for Noisy Insertion Channels
Hengfeng Liu, Chunming Tang, Cuiling Fan
DNA storage has emerged as a promising solution for large-scale and long-term data preservation. Among various error types, insertions are the most frequent errors occurring in DNA…
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…
When Do Subset Sums in Finite Abelian Groups Support -Designs?
Hengfeng Liu, Chunming Tang, Cuiling Fan +1
Subset sums over finite abelian groups lie at the intersection of additive combinatorics, design theory, and coding theory. Let be a finite abelian group, and let $\cB_k^x$ be…
Constructing bent functions and bent idempotents of any possible algebraic degrees
Chunming Tang, Yanfeng Qi, Zhengchun Zhou +1
Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few const…
Subfield Codes of Several Few-Weight Linear Codes Parametrized by Functions and Their Consequences
Li Xu, Cuiling Fan, Sihem Mesnager +2
Subfield codes of linear codes over finite fields have recently received much attention. Some of these codes are optimal and have applications in secrete sharing, authentication co…
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…
Non-GRS type Euclidean and Hermitian LCD codes and Their Applications for EAQECCs
Zhonghao Liang, Dongmei Huang, Qunying Liao +2
In recent years, the construction of non-GRS type linear codes has attracted considerable attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and…
Infinite families of -designs from a class of non-binary Kasami cyclic codes
Rong Wang, Xiaoni Du, Cuiling Fan
Combinatorial -designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The…
Combinatorial -Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
Hengfeng Liu, Chunming Tang, Cuiling Fan +1
In this paper, we establish the conditions for some finite abelian groups and the family all the -sets in each of them summing up to an element to form -designs. We fully…
Constructions of Binary Cross Z-Complementary Pairs With Large CZC Ratio
Hui Zhang, Cuiling Fan, Sihem Mesnager
Cross Z-complementary pairs (CZCPs) are a special kind of Z-complementary pairs (ZCPs) having zero autocorrelation sums around the in-phase position and end-shift position, also ha…
Near-MDS Codes from Maximal Arcs in PG
Li Xu, Cuiling Fan, Dongchun Han
The singleton defect of an linear code is defined as . Codes with are called maximum distance separable (MDS) codes, and c…