Pages that link to "Item:Q5454248"
From MaRDI portal
The following pages link to On the List and Bounded Distance Decodability of Reed–Solomon Codes (Q5454248):
Displaying 18 items.
- On the error distance of extended Reed-Solomon codes (Q326319) (← links)
- Subset sums of quadratic residues over finite fields (Q346285) (← links)
- A new sieve for distinct coordinate counting (Q625832) (← links)
- An asymptotic formula for counting subset sums over subgroups of finite fields (Q661990) (← links)
- On the subset sum problem over finite fields (Q958604) (← links)
- On error distance of Reed-Solomon codes (Q1042798) (← links)
- Constructions of cyclic quaternary constant-weight codes of weight three and distance four (Q1744017) (← links)
- The \(k\)-subset sum problem over finite fields (Q1747922) (← links)
- On deep holes of Gabidulin codes (Q1800701) (← links)
- A new sieve for restricted multiset counting (Q2032908) (← links)
- Distinct coordinate solutions of linear equations over finite fields (Q2291366) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- Cyclic codes from cyclotomic sequences of order four (Q2447744) (← links)
- Proving primality in essentially quartic random time (Q3420438) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← 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)
- On the error-correcting pair for MDS linear codes with even minimum distance (Q6156924) (← links)
