New constructions of self-dual generalized Reed-Solomon codes
From MaRDI portal
Abstract: A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider new constructions of MDS self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The critical idea of our constructions is to choose suitable evaluation points such that the corresponding (extended) GRS codes are self-dual. The evaluation set of our constructions is consists of a subgroup of finite fields and its cosets in a bigger subgroup. Four new families of MDS self-dual codes are obtained and they have better parameters than previous results in certain region. Moreover, by the Mobius action over finite fields, we give a systematic way to construct self-dual GRS codes with different evaluation points provided any known self-dual GRS codes. Specially, we prove that all the self-dual extended GRS codes over with length can be constructed from GRS codes with the same parameters.
Recommendations
- Some new constructions of MDS self-dual codes over finite fields
- On the constructions of MDS self-dual codes via cyclotomy
- New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes
- Construction of MDS self-dual codes over finite fields
- New MDS or Near-MDS Self-Dual Codes
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 2233285 (Why is no real title available?)
- A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes
- A note on the constructions of MDS self-dual codes
- Construction of MDS self-dual codes over finite fields
- Counting generalized Reed-Solomon codes
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- Explicit Constructions of MDS Self-Dual Codes
- Fundamentals of Error-Correcting Codes
- MDS self-dual codes over large prime fields
- New MDS Euclidean Self-Orthogonal Codes
- New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
- New MDS or Near-MDS Self-Dual Codes
- New MDS self-dual codes over finite fields
- New MDS self-dual codes over finite fields of odd characteristic
- New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
- On self-dual codes over some prime fields.
- On self-dual constacyclic codes over finite fields
- On the constructions of MDS self-dual codes via cyclotomy
- On the uniqueness of the Golay codes
- Orthogonal designs and MDS self-dual codes
Cited in
(15)- Construction of long MDS self-dual codes from short codes
- New constructions of self-dual codes via twisted generalized Reed-Solomon codes
- Two classes of twisted generalized Reed-Solomon codes with two twists
- New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes
- New self-dual codes from TGRS codes with general twists
- New MDS self-dual codes from GRS codes and extended GRS codes
- A generic construction on self-orthogonal algebraic geometric codes and its applications
- A class of twisted generalized Reed-Solomon codes
- New Results on Self-Dual Generalized Reed-Solomon Codes
- On the constructions of MDS self-dual codes via cyclotomy
- A new construction of partial unit memory codes based on Reed-Solomon codes
- Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- New constructions on self-dual algebraic geometry codes
- Construction of MDS Euclidean self-dual codes via multiple subsets
This page was built for publication: New constructions of self-dual generalized Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673780)
