Pages that link to "Item:Q4976034"
From MaRDI portal
The following pages link to Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes (Q4976034):
Displaying 10 items.
- Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
- Constructions of cyclic constant dimension codes (Q1752543) (← links)
- On the list decodability of rank-metric codes containing Gabidulin codes (Q2119948) (← links)
- A characterization of cyclic subspace codes via subspace polynomials (Q2422150) (← links)
- Cyclic constant dimension subspace codes via the sum of Sidon spaces (Q2697471) (← links)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius (Q5041210) (← links)
- (Q5743490) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
- New constructions of constant dimension subspace codes with large sizes (Q6499105) (← links)
