Construction of Minimal Binary Linear Codes of dimension \(n+3\)

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2024-03
Hauptverfasser: Shaikh, Wajid M, Jain, Rupali S, B Surendranath Reddy, Patil, Bhagyashri S
Format: Artikel
Sprache:eng
Schlagworte:
Binary codes
Boolean functions
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422