2024/03/19 by Jiaxin Wang, Wang, Jiaxin, Yadi Wei +5
Biochemistry, Genetics and Molecular Biology · Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2403.12578
openalex publication_date 2024/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Self-orthogonal codes are a significant class of linear codes in coding theory and have attracted a lot of attention. In \citeHLL2023Te,LH2023Se, p-ary self-orthogonal codes were constructed by using p-ary weakly regular bent functions, where p is an odd prime. In \citeWH2023Se, two classes of non-degenerate quadratic forms were used to construct q-ary self-orthogonal codes, where q is a power of a prime. In this paper, we construct new families of q-ary self-orthogonal codes using vectorial dual-bent functions. Some classes of at least almost optimal linear codes are obtained from the dual codes of the constructed self-orthogonal codes. In some cases, we completely determine the weight distributions of the constructed self-orthogonal codes. From the view of vectorial dual-bent functions, we illustrate that the works on constructing self-orthogonal codes from p-ary weakly regular bent functions \citeHLL2023Te,LH2023Se and non-degenerate quadratic forms with q being odd \citeWH2023Se can be obtained by our results. We partially answer an open problem on determining the weight distribution of a class of self-orthogonal codes given in \citeLH2023Se. As applications, we construct new infinite families of at least almost optimal q-ary linear complementary dual codes (for short, LCD codes) and quantum codes.