Efficient List Decoding of Explicit Codes with Optimal Redundancy
From MaRDI portal
Recommendations
Cites work
- Better Binary List-Decodable Codes Via Multilevel Concatenation
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Decoding of Reed Solomon codes beyond the error-correction bound
- Error-correcting codes for list decoding
- Explicit capacity-achieving list-decodable codes
- scientific article; zbMATH DE number 5764881 (Why is no real title available?)
- scientific article; zbMATH DE number 3760081 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- List Decoding and Pseudorandom Constructions
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
Cited in
(10)- Solving ECDLP via list decoding
- Optimal Rate List Decoding via Derivative Codes
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Reduced lists of error patterns for maximum likelihood soft decoding
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- scientific article; zbMATH DE number 1759459 (Why is no real title available?)
- scientific article; zbMATH DE number 6103506 (Why is no real title available?)
- Folded codes from function field towers and improved optimal rate list decoding
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
This page was built for publication: Efficient List Decoding of Explicit Codes with Optimal Redundancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386076)
