23 citations · 141 across the 48 of their papers we have counts for
5 papers · 1 filter
A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions
Can Xiang, Keqin Feng, Chunming Tang
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this…
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…
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…
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…
Linear codes with two or three weights from weakly regular bent functions
Chunming Tang, Nian Li, Yanfeng Qi +2
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly…