Infinite families of 2-designs from a class of non-binary Kasami cyclic codes

From MaRDI portal
Publication:825932

DOI10.3934/AMC.2020088zbMATH Open1479.05034arXiv1912.04745OpenAlexW3033074304MaRDI QIDQ825932FDOQ825932


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


Publication date: 18 December 2021

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: Combinatorial t-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and t-designs has been attracted a lot of attention for both directions. It is well known that a linear code over any finite field can be derived from the incidence matrix of a t-design, meanwhile, that the supports of all codewords with a fixed weight in a code also may hold a t-design. In this paper, by determining the weight distribution of a class of linear codes derived from non-binary Kasami cyclic codes, we obtain infinite families of 2-designs from the supports of all codewords with a fixed weight in these codes, and calculate their parameters explicitly.


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Infinite families of 2-designs from a class of non-binary Kasami cyclic codes

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