A Construction of Minimal Linear Codes From Partial Difference Sets

DOI10.1109/TIT.2021.3067049MaRDI QIDQ5001753zbMATH OpenOpenAlexFDO

Authors

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

applications in secret sharing schemesthree-weight or four-weight minimal linear codes

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Abstract: In this paper, we study a class of linear codes defined by characteristic functions of certain subsets of a finite field. We derive a sufficient and necessary condition for such a code to be a minimal linear code by a character-theoretical approach. We obtain new three-weight or four-weight minimal linear codes that do not satisfy the Ashikhmin-Barg condition by using partial difference sets. We show that our construction yields minimal linear codes that do not arise from cutting vectorial blocking sets, and also discuss their applications in secret sharing schemes.

Cited in

(8)

• Minimal linear codes from weakly regular bent functions
• A new class of near-optimal partial Fourier codebooks from an almost difference set
• Minimal linear codes constructed from partial spreads
• New constructions of signed difference sets
• Minimal linear codes from vectorial functions
• Complete weight enumerators of few-weight linear codes
• Construction of minimal binary linear codes with dimension n+3
• Constructions of binary self-orthogonal singly-even wide minimal linear codes with few weights

This page was built for publication: A Construction of Minimal Linear Codes From Partial Difference Sets

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