Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions

From MaRDI portal
Publication:6169864

DOI10.1142/S0129054121500143zbMATH Open1522.05017arXiv1912.07531OpenAlexW3125593121WikidataQ114978623 ScholiaQ114978623MaRDI QIDQ6169864FDOQ6169864


Authors: Rong Wang, Xiaoni Du, Cui Ling Fan, Zhihua Niu Edit this on Wikidata


Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Abstract: Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial t-designs have been attracted lots of research interest for decades. The interplay between coding theory and t-designs has on going for many years. As we all known, t-designs can be used to derive linear codes over any finite field, as well as the supports of all codewords with a fixed weight in a code also may hold a t-design. In this paper, we first construct a class of linear codes from cyclic codes related to Dembowski-Ostrom functions. By using exponential sums, we then determine the weight distribution of the linear codes. Finally, we obtain infinite families of 2-designs from the supports of all codewords with a fixed weight in these codes. Furthermore, the parameters of 2-designs are calculated explicitly.


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




Recommendations




Cites Work


Cited In (10)





This page was built for publication: Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions

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