Linear complementary dual (LCD) codes and selforthogonal codes have attracted wide attention in recent years for some practical applications. Hence, in this paper, we use simplicial complexes for construction of an infinite family of binary LCD codes and two infinite families of binary selforthogonal codes. Moreover, we explicitly determine the weight distributions of these codes. We obtain binary LCD codes which have minimum weights two or three, and we also find some selforthogonal codes meeting the Griesmer bound. As examples, we also present some (almost) optimal binary self-orthogonal codes and LCD distance optimal codes.
10 October 2019 in IEEE Transactions on Information Theory
Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun et al. Inspired by their work, we present two new constructions of codes over the ring F2+uF2 by employing simplicial complexes. When the simplicial complexes are all generated by a maximal element, we determine the Lee weight distributions of two classes of the codes over F2 + uF2. Our results show that the codes have few weights with respect to Lee weights. Via the Gray map, we obtain an infinite family of binary codes meeting the Griesmer bound and a class of binary distance optimal codes.
The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code are very effective in general. Maximum distance separable (MDS) codes are codes meeting the Singleton bound. Twisted Reed-Solomon codes is a generalization of Reed-Solomon codes, which is also a nice construction for MDS codes. In this short letter, we obtain some twisted Reed-Solomon MDS codes with one-dimensional hull. Moreover, these codes are not monomially equivalent to Reed-Solomon codes.
14 January 2022 in IEEE Transactions on Information Theory
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and defining sets. Second, we construct quaternary linear codes via simplicial complexes and determine the weight distributions of these codes. Third, the weight distributions of the binary subfield codes of these quaternary codes are also computed by employing the general characterization. Furthermore, we present two infinite families of optimal linear codes with respect to the Griesmer Bound, and a class of binary almost optimal codes with respect to the Sphere Packing Bound. We also need to emphasize that we obtain at least 9 new quaternary linear codes.
2 February 2019 in Designs, Codes and Cryptography