Pages that link to "Item:Q3191984"
From MaRDI portal
The following pages link to List decoding algorithms for certain concatenated codes (Q3191984):
Displaying 22 items.
- Almost disjunctive list-decoding codes (Q259899) (← links)
- List decoding of repeated codes (Q371249) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- List cascade decoding (Q1168285) (← links)
- New constructions for IPP codes (Q1781000) (← links)
- Storing information with extractors. (Q1853081) (← links)
- On the complexity of approximating the VC dimension. (Q1872731) (← links)
- Reconstructive dispersers and hitting set generators (Q2391190) (← links)
- List Decoding of Crisscross Errors (Q2979085) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Better Binary List-Decodable Codes Via Multilevel Concatenation (Q3603493) (← links)
- Bounds on the List-Decoding Radius of Reed--Solomon Codes (Q4443130) (← links)
- List decoding of wavelet codes (Q5134251) (← links)
- List Decoding of Direct Sum Codes (Q5146861) (← links)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results (Q5323002) (← links)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets (Q5429508) (← links)
- (Q5875753) (← links)
- Algorithmic Results in List Decoding (Q5898676) (← links)
- Algorithmic Results in List Decoding (Q5900252) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)