New Constructions of Optimal Linear Codes From Simplicial Complexes

• Published in: IEEE transactions on information theory Vol. 70; no. 3; p. 1
• Main Authors: Hu, Zhao, Xu, Yunge, Li, Nian, Zeng, Xiangyong, Wang, Lisha, Tang, Xiaohu
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Codes; Cryptography; Encoding; Griesmer code; Hamming weight; Linear codes; Mathematics; Near Griesmer code; Optimal linear code; Optimization; Parameters; Simplicial complex; Technological innovation; Weight distribution
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2023.3305609

In this paper, we construct a large family of projective linear codes over F q from the general simplicial complexes of F m q via the defining-set construction, which generalizes the results of [IEEE Trans. Inf. Theory 66(11):6762-6773, 2020]. The parameters and weight distributions of this class of codes are completely determined. By using the Griesmer bound, we give a necessary and sufficient condition such that the codes are Griesmer codes and a sufficient condition such that the codes are distance-optimal. For a special case, we also present a necessary and sufficient condition for the codes to be near Griesmer codes. Moreover, by discussing the cases of simplicial complexes with one, two and three maximal elements respectively, the parameters and weight distributions of the codes are given more explicitly, which shows that the codes are at most 2-weight, 5-weight and 19-weight respectively. By studying the optimality of the codes for the three cases in detail, many infinite families of optimal linear codes with few weights over F q are obtained, including Griesmer codes, near Griesmer codes and distance-optimal codes.