It characterizes self-duality and near-MDS status for one-codimensional subcodes of generalized Reed-Solomon codes for all r, and determines the dual codes for r=1,2,k-1.
A family of linear codes that are either non-GRS MDS codes or NMDS codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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 involving their parameters, weight distributions, and self-orthogonal properties. We prove that such codes are either non-GRS MDS codes or NMDS codes, and hence, they can produce as many of the desired codes as possible. We also completely 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.
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On subcodes of the generalized Reed-Solomon codes
It characterizes self-duality and near-MDS status for one-codimensional subcodes of generalized Reed-Solomon codes for all r, and determines the dual codes for r=1,2,k-1.