Infinite Families of Optimal Codes Over Non-Unital Non-Commutative Rings From Simplicial Complexes
- 2 March 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (5) , 2823-2840
Abstract
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters of these codes are characterized. Specially, when the employed simplicial complexes are generated by a single maximal element, we determine their Lee weight distributions completely. Furthermore, by considering the Gray image codes and the corresponding subfield-like codes, numerous of linear codes over $\mathbb {F}_{q}$ are also obtained, where $q$ is a prime power. Certain conditions are given to ensure the above linear codes are (Hermitian) self-orthogonal in the case of $q=2,3,4$ . It is noteworthy that most of the derived codes over $\mathbb {F}_{q}$ satisfy the Ashikhmin-Barg’s condition for minimality. Besides, we obtain two infinite families of distance-optimal codes over $\mathbb {F}_{q}$ with respect to the Griesmer bound. By puncturing the Gray image codes and subfield-like codes, several classes of projective codes are presented.Keywords
Funding Information
- National Natural Science Foundation of China (12501738)
- National Natural Science Foundation of China (12571574)
- National Natural Science Foundation of China (12201356)
- National Natural Science Foundation of China (62372445)
- Shandong Provincial Postdoctoral Science Foundation (ZR2022QA048)
- National Key Research and Development Program of China (2021YFA1000600)
This publication has 41 references indexed in Scilit:
- Linear codes from simplicial complexes over ${\mathbb {F}}_{2^n}$Designs, Codes and Cryptography, 2024
- Minimal and optimal binary codes obtained using $C_D$-construction over the non-unital ring IDesigns, Codes and Cryptography, 2023
- Octanary linear codes using simplicial complexesCryptography and Communications, 2022
- New classes of binary few weight codes from trace codes over a chain ringJournal of Applied Mathematics and Computing, 2021
- Few-weight codes over associated with down sets and their distance optimal Gray imageDiscrete Applied Mathematics, 2020
- Optimal non-projective linear codes constructed from down-setsDiscrete Applied Mathematics, 2019
- Linear codes from simplicial complexesDesigns, Codes and Cryptography, 2017
- Two and three weight codes over F p + u F p $\mathbb {F}_{p}+u\mathbb {F}_{p}$Cryptography and Communications, 2016
- Linear codes with two or three weights from quadratic Bent functionsDesigns, Codes and Cryptography, 2015
- Quantum codes from nearly self-orthogonal quaternary linear codesDesigns, Codes and Cryptography, 2014