2015/08/23 by Yanfeng Qi, Qi, Yanfeng, Chunming Tang +5
Computer Science · Medicine · #Cancer Mechanisms and Therapy #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1508.05672
openalex publication_date 2015/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \citeM2014, Xu et al. \citeXCX2015 and p-ary bent functions by Xu et al. \citeXC2015 to the construction of p-ary weakly regular bent functions and presents new infinite families of p-ary weakly regular bent functions from some known weakly regular bent functions (square functions, Kasami functions, and the Maiorana-McFarland class of bent functions). Further, new infinite families of p-ary bent idempotents are obtained.