Construction of Minimal Binary Linear Codes of dimension $n+3$
Information Theory
2024-03-21 v1 math.IT
Rings and Algebras
Abstract
In this paper, we will give the generic construction of a binary linear code of dimension 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.
Cite
@article{arxiv.2403.13350,
title = {Construction of Minimal Binary Linear Codes of dimension $n+3$},
author = {Wajid M. Shaikh and Rupali S. Jain and B. Surendranath Reddy and Bhagyashri S. Patil},
journal= {arXiv preprint arXiv:2403.13350},
year = {2024}
}