Deep holes of twisted Reed-Solomon codes
From MaRDI portal
Cites work
- A class of twisted generalized Reed-Solomon codes
- A new sieve for distinct coordinate counting
- A Random Linear Network Coding Approach to Multicast
- Computing error distance of Reed-Solomon codes
- Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
- Cryptanalysis of a system based on twisted Reed-Solomon codes
- Deep Holes and MDS Extensions of Reed–Solomon Codes
- Deep holes in Reed-Solomon codes based on Dickson polynomials
- Deep holes of generalized Reed-Solomon codes
- Deep Holes of Projective Reed-Solomon Codes
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fundamentals of Error-Correcting Codes
- Gauss sums of the cubic character over \(\text{GF}(2^m)\): an elementary derivation
- scientific article; zbMATH DE number 3167805 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
- MDS and near-MDS codes via twisted Reed-Solomon codes
- MDS or NMDS self-dual codes from twisted generalized Reed-Solomon codes
- MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes
- On ``bent functions
- On Deciding Deep Holes of Reed-Solomon Codes
- On deep holes of elliptic curve codes
- On deep holes of standard Reed-Solomon codes
- On Determining Deep Holes of Generalized Reed–Solomon Codes
- On error distance of Reed-Solomon codes
- On MDS extensions of generalized Reed- Solomon codes
- On the covering radius of Reed-Solomon codes
- On the subset sum problem over finite fields
- Singularities of symmetric hypersurfaces and Reed-Solomon codes
- The complexity of computing the covering radius of a code
- Twisted Reed–Solomon Codes
This page was built for publication: Deep holes of twisted Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939573)