Pages that link to "Item:Q4674491"
From MaRDI portal
The following pages link to Combinatorial bounds for list decoding (Q4674491):
Displaying 21 items.
- List decodability at small radii (Q717148) (← links)
- Robustly reusable fuzzy extractor with imperfect randomness (Q831183) (← links)
- Bounds for codes in the case of list decoding of finite volume (Q1090661) (← links)
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition (Q1780828) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Combinatorial Limitations of Average-Radius List Decoding (Q2851888) (← links)
- On the list-decodability of random linear codes (Q2875168) (← links)
- List decoding algorithms for certain concatenated codes (Q3191984) (← links)
- The Complexity of Local List Decoding (Q3541812) (← links)
- Explicit List-decodable codes with optimal rate for computationally bounded channels (Q4636479) (← links)
- (Q5009547) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- Decision List Compression by Mild Random Restrictions (Q5056434) (← links)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results (Q5323002) (← links)
- Algorithmic Results in List Decoding (Q5898676) (← links)
- Algorithmic Results in List Decoding (Q5900252) (← links)
- (Q6084352) (← links)
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
