Constructions of linear codes with two or three weights from vectorial dual-bent functions

From MaRDI portal
Publication:6041565

DOI10.1016/J.DISC.2023.113448zbMATH Open1521.94102arXiv2207.11668MaRDI QIDQ6041565FDOQ6041565


Authors: Jiaxin Wang, Zexia Shi, Yadi Wei, Fangwei Fu Edit this on Wikidata


Publication date: 31 May 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of q-ary linear codes with two or three weights from vectorial dual-bent functions, where q is a power of an odd prime p. The weight distributions of the constructed q-ary linear codes are completely determined. We illustrate that some known constructions in the literature can be obtained by our constructions. In some special cases, our constructed linear codes can meet the Griesmer bound. Furthermore, based on the constructed q-ary linear codes, we obtain secret sharing schemes with interesting access structures.


Full work available at URL: https://arxiv.org/abs/2207.11668




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Constructions of linear codes with two or three weights from vectorial dual-bent functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041565)