Construction of MDS self-dual codes over finite fields

DOI10.1016/j.ffa.2019.05.007zbMath1421.94096arXiv1807.10625OpenAlexW2951417062MaRDI QIDQ2326693

Yanyan Li

Publication date: 10 October 2019

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.10625

zbMATH Keywords

MDS codesself-dual codegeneralized Reed-Solomon codeextended Reed-Solomon code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Related Items (11)

A class of twisted generalized Reed-Solomon codes ⋮ Construction of long MDS self-dual codes from short codes ⋮ Some new constructions of MDS self-dual codes over finite fields ⋮ New MDS self-dual codes over finite fields of odd characteristic ⋮ New constructions of self-dual generalized Reed-Solomon codes ⋮ Generic constructions of MDS Euclidean self-dual codes via GRS codes ⋮ A class of double-twisted generalized Reed-Solomon codes ⋮ New MDS self-dual codes from GRS codes and extended GRS codes ⋮ The \((+)\)-extended twisted generalized Reed-Solomon code ⋮ MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes ⋮ On Euclidean hulls of MDS codes

Cites Work

• Unnamed Item
• New MDS self-dual codes over finite fields
• Euclidean and Hermitian self-dual MDS codes over large finite fields.
• A note on the constructions of MDS self-dual codes
• MDS self-dual codes over large prime fields
• On self-dual codes over some prime fields.
• On the Classification of MDS Codes
• Lowest density MDS codes over extension alphabets
• On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
• New MDS or Near-MDS Self-Dual Codes
• New MDS Self-Dual Codes From Generalized Reed—Solomon Codes

This page was built for publication: Construction of MDS self-dual codes over finite fields