Abstract
Linear codes with 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
