2000 character limit reached
Construction of Minimal Binary Linear Codes of dimension $n+3$ (2403.13350v1)
Published 20 Mar 2024 in cs.IT, math.IT, and math.RA
Abstract: In this paper, we will give the generic construction of a binary linear code of dimension $n+3$ and derive the necessary and sufficient conditions for the constructed code to be minimal. Using generic construction, a new family of minimal binary linear code will be constructed from a special class of Boolean functions violating the Ashikhmin-Barg condition. We also obtain the weight distribution of the constructed minimal binary linear code.