Pages that link to "Item:Q3604484"
From MaRDI portal
The following pages link to Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy (Q3604484):
Displayed 33 items.
- A novel elementary construction of matching vectors (Q436582) (← links)
- Optimal rate algebraic list decoding using narrow ray class fields (Q472174) (← links)
- Variety evasive sets (Q475333) (← links)
- Group homomorphisms as error correcting codes (Q490299) (← links)
- Algebraic decoding of folded Gabidulin codes (Q510495) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Nearly optimal robust secret sharing (Q1999899) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
- Explicit subspace designs (Q2400105) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- Optimal Rate List Decoding via Derivative Codes (Q3088129) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- (Q5002755) (← links)
- (Q5009547) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)
- Privacy-Preserving Support Vector Machines with Flexible Deployment and Error Correction (Q5095933) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- (Q5121892) (← links)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results (Q5323002) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- (Q5875528) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes (Q6130603) (← 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)