A linear code is optimal if it has the highest minimum distance of any linear code with a given length and dimension. We construct infinite families of optimal binary linear codes CΔc constructed from simplicial complexes in 픽n2, where Δc is a simplicial complex in 픽n2 and Δc the complement of Δ. We first find an explicit computable criterion for CΔc to be optimal; this criterion is given in terms of the 2-adic valuation of Ps Σis=1 2|Ai|-1; where the Ai’s are maximal elements of Δ. Furthermore, we obtain much simpler criteria under various specific conditions on the maximal elements of. In particular, we find that CΔc is a Griesmer code if and only if the maximal elements of Δ are pairwise disjoint and their sizes are all distinct. Specially, when F has exactly two maximal elements, we explicitly determine the weight distribution of CΔc. We present many optimal linear codes constructed by our method, and we emphasize that we obtain at least 32 new optimal linear codes.
7 June 2021 in IEEE Transactions on Information Theory
Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So far, most of LCD MDS codes have been constructed by employing generalized Reed-Solomon codes. In this paper we construct some classes of new Euclidean LCD MDS codes and Hermitian LCD MDS codes which are not monomially equivalent to Reed-Solomon codes, called LCD MDS codes of non-Reed-Solomon type. Our method is based on the constructions of Beelen et al. (2017) and Roth and Lempel (1989). To the best of our knowledge, this is the first paper on the construction of LCD MDS codes of non-Reed-Solomon type; any LCD MDS code of non-Reed-Solomon type constructed by our method is not monomially equivalent to any LCD code constructed by the method of Carlet et al. (2018).