Pages that link to "Item:Q5346487"

The following pages link to Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes (Q5346487):

Displaying 16 items.

• List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
• Optimal rate algebraic list decoding using narrow ray class fields (Q472174) (← links)
• Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
• Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
• Explicit subspace designs (Q2400105) (← links)
• On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451) (← links)
• Subspace designs based on algebraic function fields (Q4691091) (← 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)
• Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
• (Q5121892) (← links)
• Rank-Metric Codes and Their Applications (Q5863764) (← links)
• Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q5875494) (← links)
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← 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)