Minfeng Shao

Dr. Minfeng Shao

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
6 April 2020 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
MSMinfeng Shao
Minfeng Shao
YMYing Miao
Ying Miao

3 January 2025 in Peer-to-Peer Networking and Applications
Verified
Journal Article
Closed access
PDF file
TZTiantian Zhou
Tiantian Zhou
ZTZehui Tang
Zehui Tang
SZShengke Zeng
Shengke Zeng
MSMinfeng Shao
Minfeng Shao

25 August 2020 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
MSMinfeng Shao
Minfeng Shao
YMYing Miao
Ying Miao

31 October 2024 in Entropy
Verified
Journal Article
Open access
PDF file
MSMinfeng Shao
Minfeng Shao
YMYing Miao
Ying Miao
Frequency-hopping sequences (FHSs) with low Hamming correlation are essential for synchronization and multiple-access communication systems. In this paper, we propose a novel construction of FHSs using generalized cyclotomy. Our results reveal that the constructed FHSs exhibit a one-coincidence property, meaning that the smallest correlation between different FHSs, aside from the trivial case, is minimized. Additionally, the new sets of FHSs achieve an optimal size in relation to a known theoretical bound.

30 August 2024 in Entropy
Verified
Journal Article
Open access
PDF file
MSMinfeng Shao
Minfeng Shao
XNXianhua Niu
Xianhua Niu
Two-dimensional optical orthogonal codes have important applications in optical code division multiple access networks. In this paper, a generic construction of two-dimensional optical orthogonal codes with at most one pulse per wavelength (AM-OPPW 2D OOCs) is proposed. As a result, some optimal AM-OPPW 2D OOCs with new parameters can be yielded. The new AM-OPPW 2D OOC may support more subscribers and heavier asynchronous traffic compared with known constructions.

10 February 2020 in arXiv
Verified
Preprint
Open access
PDF file
MSMinfeng Shao
Minfeng Shao
YMYing Miao
Ying Miao
In this paper, we study the relationship between algebraic manipulation detection (AMD) codes and highly nonlinear functions. As applications, on one hand, a generic construction for systematic AMD codes is introduced based on highly nonlinear functions. Systematic AMD codes with new parameters can be generated from known highly nonlinear functions. Especially, several infinite classes of optimal systematic AMD codes, some with asymptotically optimal tag size, can be constructed. On the other hand, systematic AMD codes are used to construct highly nonlinear functions. The known construction by Cramer et al. [10] for systematic AMD codes turns out to be based on a special kind of functions with high nonlinearity.