Self-Orthogonal Codes from Vectorial Dual-Bent Functions
Abstract
Self-orthogonal codes are a significant class of linear codes in coding theory and have attracted a lot of attention. In \cite{HLL2023Te,LH2023Se}, -ary self-orthogonal codes were constructed by using -ary weakly regular bent functions, where is an odd prime. In \cite{WH2023Se}, two classes of non-degenerate quadratic forms were used to construct -ary self-orthogonal codes, where is a power of a prime. In this paper, we construct new families of -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 -ary weakly regular bent functions \cite{HLL2023Te,LH2023Se} and non-degenerate quadratic forms with being odd \cite{WH2023Se} 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 \cite{LH2023Se}. As applications, we construct new infinite families of at least almost optimal -ary linear complementary dual codes (for short, LCD codes) and quantum codes.
Cite
@article{arxiv.2403.12578,
title = {Self-Orthogonal Codes from Vectorial Dual-Bent Functions},
author = {Jiaxin Wang and Yadi Wei and Fang-Wei Fu and Juan Li},
journal= {arXiv preprint arXiv:2403.12578},
year = {2024}
}