Construction of Minimal Binary Linear Codes of dimension $n+3$
<|reference_start|>Construction of Minimal Binary Linear Codes of dimension $n+3$: 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.<|reference_end|>
@article{shaikh2024construction,
    title={Construction of Minimal Binary Linear Codes of dimension $n+3$},
    author={Wajid M. Shaikh, Rupali S. Jain, B. Surendranath Reddy, Bhagyashri S.
  Patil},
    journal={arXiv preprint arXiv:2403.13350},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.13350},
    primaryClass={cs.IT math.IT math.RA}
}