Pages that link to "Item:Q2875169"
From MaRDI portal
The following pages link to Local list-decoding and testing of random linear codes from high error (Q2875169):
Displaying 6 items.
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- Sparse affine-invariant linear codes are locally testable (Q2012176) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Relaxed Locally Correctable Codes (Q4993290) (← links)
- A combination of testability and decodability by tensor products (Q5252263) (← links)
