The [1, 0]-twisted generalized Reed-Solomon code
From MaRDI portal
Publication:6587220
self-dual codesMDS codesNMDS codesLCD codesalmost self-dual codes\([1, 0\)-twisted generalized Reed-Solomon codes]
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 6765484 (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 modified Gilbert-Varshamov bound for self-dual quasi-twisted codes of index four
- A new family of linear maximum rank distance codes
- A note on the constructions of MDS self-dual codes
- Construction of MDS self-dual codes over finite fields
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes
- Euclidean and Hermitian LCD MDS codes
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- Fundamentals of Error-Correcting Codes
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- MDS self-dual codes over large prime fields
- New Constructions of MDS Codes With Complementary Duals
- 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
- On near-MDS codes
- On self-dual negacirculant codes of index two and four
- On the subset sum problem over finite fields
- Orthogonal designs and MDS self-dual codes
- Self-dual codes and orthogonal matrices over large finite fields
- Twisted Reed–Solomon Codes
Cited in
(2)
This page was built for publication: The \([1, 0]\)-twisted generalized Reed-Solomon code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587220)
