Determining hulls of generalized Reed-Solomon codes from algebraic geometry codes
From MaRDI portal
Cites work
- A note on the constructions of MDS self-dual codes
- Affine and projective planes
- Algebraic Function Fields and Codes
- Computing automorphism groups of error-correcting codes
- Construction of MDS self-dual codes over finite fields
- Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs
- Factorizations of Binomial Polynomials and Enumerations of LCD and Self-Dual Constacyclic Codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Hulls of Generalized Reed-Solomon Codes via Goppa Codes and Their Applications to Quantum Codes
- Hulls of Reed-Solomon Codes via Algebraic Geometry Codes
- Introduction to Coding Theory
- LCD Cyclic Codes Over Finite Fields
- Linear codes with complementary duals
- Many non-Reed-Solomon type MDS codes from arbitrary genus algebraic curves
- MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction
- New Constructions of MDS Codes With Complementary Duals
- New Galois hulls of generalized Reed-Solomon codes
- New LCD MDS codes constructed from generalized Reed-Solomon codes
- New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes
- New MDS Self-Dual Codes From Generalized Reed—Solomon Codes
- On Euclidean hulls of MDS codes
- On MDS geometric \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t} \)-codes
- On the Dimension of the Hull
- On the Hull-Variation Problem of Equivalent Linear Codes
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Some New Constructions of Quantum MDS Codes
- The maximal length of \(q\)-ary MDS elliptic codes is close to \(\frac{q}{2}\)
This page was built for publication: Determining hulls of generalized Reed-Solomon codes from algebraic geometry codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409363)