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).
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.
In this paper we construct infinite families of elliptic curves with given torsion group structures over cubic number fields. This result provides explicit examples of the theoretical result recently developed by the first two authors and A. Schweizer; they determined all the group structures which occur infinitely often as the torsion of elliptic curves over cubic number fields. In fact, this paper presents an efficient way of constructing such families of elliptic curves with prescribed torsion group structures over cubic number fields.
We construct infinite families of elliptic curves with given torsion group structures over quartic number fields. In a 2006 paper, the first two authors and Park determined all of the group structures which occur infinitely often as the torsion of elliptic curves over quartic number fields. Our result presents explicit examples of their theoretical result. This paper also presents an efficient way of finding such families of elliptic curves with prescribed torsion group structures over quadratic or quartic number fields.
4 June 2018 in IEEE Transactions on Information Theory
A p-ary function f in n variables is an l-form if f(tu) = tlf(u) for any nonzero t in Zp and u in Znp. Let n be a positive even integer, p an odd prime and l an element of {1,2,…, p – 1} provided that l ≠ p – 1 if p > 3. Let f be a p-ary bent function in n variables of l-form with f(0) = 0 and gcd(l – 1; p – 1) = 1, and let Hl = {tl : t ∈ Z*p}. We denote by Gf,l the Cayley graph Cay(Znp, ∪s∈Hlf–1(s)). Our main results are as follows: (a) If there is weakly regular p-ary bent f which is not regular, then l is 2. (b) If l = 2, then f is weakly regular p-ary bent if and only if the Cayley graph Gf,l is strongly regular. (c) If l ≠ 2, then f is regular p-ary bent if and only if the Cayley graph Gf,l is strongly regular. (d) Gf,l can be replaced by Cay(Znp, f–1(0)/ {0}) in (b) and (c). (e) Amorphic association schemes are derived by using (b) and (c). We prove our main results by computing at most four distinct restricted eigenvalues of Gf,l.