20 June 2023 in IEEE Transactions on Information Theory
In this work, we study and determine the dimensions of Euclidean and Hermitian hulls of two classical propagation rules, namely, the (u, u + v)-construction and the direct sum construction. Some new criteria for the resulting codes derived from these two propagation rules being self-dual, self-orthogonal, or linear complementary dual (LCD) codes are given. As applications, we employ the (u, u + v)-construction to obtain (almost) self-orthogonal codes; employ the direct sum construction to provide lower bounds on the minimum distance of FSD (LCD) codes; and employ both these two constructions to derive linear codes with prescribed hull dimensions. Many (almost) optimal codes are presented. In particular, a family of binary almost Euclidean self-orthogonal Griesmer codes is constructed. We also obtain many binary, ternary Euclidean and quaternary Hermitian FSD LCD codes of larger lengths and improve some lower bounds on the minimum distance of known ternary Euclidean LCD codes.
17 December 2022 in Cryptography and Communications
13 February 2025 in IEEE Transactions on Information Theory
Maximum distance separable (MDS) codes that are not monomially equivalent to generalized Reed-Solomon (GRS) codes are called non-GRS MDS codes, which have important applications in communication and cryptography. Covering radii and deep holes of linear codes are closely related to their decoding problems. In the literature, the covering radii and deep holes of GRS codes have been extensively studied, while little is known about non-GRS MDS codes. In this paper, we study two classes of extended twisted generalized Reed-Solomon (ETGRS) codes involving their non-GRS MDS properties, covering radii, and deep holes. In other words, we obtain two classes of non-GRS MDS codes with known covering radii and deep holes. As applications, we further directly derive more non-GRS MDS codes, and get some results on the existence of their error-correcting pairs. As a byproduct, we find some connections between the well-known Roth-Lempel codes and these two classes ETGRS codes.
10 September 2025 in IEEE Transactions on Communications
Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we introduce and study a new family of linear codes, including their parameters, weight distributions, and self-orthogonal properties. We prove that such codes are either non-GRS MDS codes or NMDS codes. We also determine their weight distributions with the help of the solutions to some subset sum problems. A sufficient and necessary condition for such codes to be self-orthogonal is characterized. Based on this condition, we further deduce that there are no self-dual codes in this class of linear codes and explicitly construct two new classes of almost self-dual codes.
22 May 2024 in IEEE Transactions on Information Theory
The class of ℓ-maximum distance separable (ℓ-MDS) codes is a generalization of maximum distance separable (MDS) codes that has attracted a lot of attention due to its applications in several areas such as secret sharing schemes, index coding problems, informed source coding problems and combinatorial t -designs. In this paper, for ℓ = 1, we completely solve a conjecture recently proposed by Heng et al : (Discrete Mathematics, 346(10): 113538, 2023) and obtain infinite families of 1-MDS codes with general dimensions holding 2-designs. These later codes are also proved to be optimal locally recoverable codes. For general positive integers ℓ and ℓ′, we construct new ℓ-MDS codes from known ℓ′-MDS codes via some classical propagation rules involving the extended, expurgated, and (u, u+v) constructions. Finally, we study some general results including characterization, weight distributions, and bounds on maximum lengths of ℓ-MDS codes, which generalize, simplify, or improve some known results in the literature.
22 March 2023 in Quantum Information Processing