23 May 2019 in IEEE Transactions on Information Theory
Minimal linear codes are a special subclass of linear codes and have significant applications in secret sharing and secure two-party computation. In this paper, we focus on constructing minimal linear codes with wmin/wmax ≤ p–1/p for any odd prime p based on a generic construction of linear codes, where wmin and wmax denote the minimum and maximum nonzero weights in a code, respectively. First, we present two new infinite families of minimal linear codes with two or three weights by selecting suitable subcode of linear codes which are not minimal. Second, we also present an infinite family of minimal linear codes by employing partial spreads, which can be viewed as a generalization of the construction of Ding et al. In addition, we determine the weight distributions of all these minimal linear codes.
4 March 2022 in IEEE Transactions on Information Theory
Combinatorial designs are closely related to linear codes. Recently, some near MDS codes were employed to construct $t$ -designs by Ding and Tang, which settles the question as to whether there exists an infinite family of near MDS codes holding an infinite family of $t$ -designs for $t \geq 2$ . This paper is devoted to the construction of infinite families of 3-designs and 2-designs from special equations over finite fields. First, we present an infinite family of almost MDS codes over ${\mathrm{ GF}}(p^{m})$ holding an infinite family of 3-designs. We then provide an infinite family of almost MDS codes over ${\mathrm{ GF}}(p^{m})$ holding an infinite family of 2-designs for any field ${\mathrm{ GF}}(q)$ . In particular, some of these almost MDS codes are near MDS. Second, we present an infinite family of near MDS codes over ${\mathrm{ GF}}(2^{m})$ holding an infinite family of 3-designs by considering the number of roots of a special linearized polynomial. Compared to previous constructions of 3-designs or 2-designs from linear codes, the parameters of some of our designs are new and flexible.
3 October 2015 in Cryptography and Communications
20 August 2016 in Applicable Algebra in Engineering, Communication and Computing