MDS self-dual codes over large prime fields
Construction techniques for self-dual codes using combinatorial designs are well known. Recently, a new method of constructing self-dual codes was established using orthogonal designs. This method has led to the construction of many new self-dual codes over small fields and rings. This paper gives a generalization of this method to generalized orthogonal designs, and it presents a new method using Diophantine equations over \(\text{GF}(p)\) to find generator matrices for self-dual codes. These two methods are used to construct self-dual codes over \(\text{GF}(31)\) and \(\text{GF}(37)\).
- Combinatorial designs and codes over some prime fields
- Self-orthogonal and self-dual codes constructed via combinatorial designs and Diophantine equations
- scientific article; zbMATH DE number 2104837
- Some new constructions of MDS self-dual codes over finite fields
- Orthogonal designs and MDS self-dual codes
- Formally self-dual codes related to Type II codes
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3637895 (Why is no real title available?)
- scientific article; zbMATH DE number 1284416 (Why is no real title available?)
- scientific article; zbMATH DE number 1424159 (Why is no real title available?)
- scientific article; zbMATH DE number 2192080 (Why is no real title available?)
- New optimal self-dual codes over GF(7).
- On self-dual codes over some prime fields.
- Orthogonal designs and Type II codes over \(\mathbb Z_{2k}\)
- Orthogonal desingns
- Self-dual codes over F/sub p/ and weighing matrices
- Self-dual codes over GF(5)
- Self-dual codes over GF(7) and orthogonal designs
- Self-dual codes over<tex>GF(7)</tex>(Corresp.)
- Self-dual doubly circulant codes
- Euclidean and Hermitian self-dual MDS codes over large finite fields.
- A note on the constructions of MDS self-dual codes
- Self-dual codes and orthogonal matrices over large finite fields
- On self-dual codes over some prime fields.
- Self-orthogonal and self-dual codes constructed via combinatorial designs and Diophantine equations
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- A class of twisted generalized Reed-Solomon codes
- New MDS self-dual codes over finite fields of odd characteristic
- MDS and near-MDS self-dual codes over large prime fields
- Construction of MDS self-dual codes over finite fields
- Combinatorial designs and codes over some prime fields
- Construction of long MDS self-dual codes from short codes
- Some new constructions of MDS self-dual codes over finite fields
- Constructions of optimal Hermitian self-dual codes from unitary matrices
- On Euclidean self-dual codes and isometry codes
- New constructions of self-dual generalized Reed-Solomon codes
- scientific article; zbMATH DE number 1504680 (Why is no real title available?)
- scientific article; zbMATH DE number 2104837 (Why is no real title available?)
- scientific article; zbMATH DE number 1424159 (Why is no real title available?)
- scientific article; zbMATH DE number 7527435 (Why is no real title available?)
- Orthogonal designs and MDS self-dual 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
- The \([1, 0]\)-twisted generalized Reed-Solomon code
- New MDS self-dual codes over finite fields
- Construction of MDS Euclidean self-dual codes via multiple subsets
- Two classes of twisted generalized Reed-Solomon codes with two twists
- New families of self-dual codes
This page was built for publication: MDS self-dual codes over large prime fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867458)
