Subspace subcodes of Reed-Solomon codes
From MaRDI portal
Publication:4701162
Recommendations
Cited in
(16)- Constacyclic additive codes over finite fields
- Subgroup subcodes
- Entanglement-assisted quantum error-correcting codes from subfield subcodes of projective Reed-Solomon codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Properties of numeric codes for the scheme of random subspaces RSC
- Subspace subcodes of generalized Reed-Solomon codes
- \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
- New identities relating wild Goppa codes
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Efficient encoding for a class of subspace subcodes
- Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes
- An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)
- The dimension of subcode-subfields of shortened generalized Reed-Solomon codes
- Direct constructions of additive codes
- Repairing Reed-Solomon Codes via Subspace Polynomials
- Subspace Codes
This page was built for publication: Subspace subcodes of Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701162)