Infinite families of 2-designs from two classes of linear codes
From MaRDI portal
Publication:6315809
arXiv1903.07459MaRDI QIDQ6315809FDOQ6315809
Authors: Xiaoni Du, Rong Wang, Chun-Ming Tang, Qi Wang
Publication date: 18 March 2019
Abstract: The interplay between coding theory and -designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a -design. In this paper, by determining the weight distributions of two classes of linear codes, we derive infinite families of -designs from the supports of codewords with a fixed weight in these codes, and explicitly obtain their parameters.
Combinatorial aspects of block designs (05B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
This page was built for publication: Infinite families of $2$-designs from two classes of linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6315809)