The following pages link to Error exponents of expander codes (Q4674540):
Displaying 20 items.
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes (Q259876) (← links)
- Eigenvalues and expansion of bipartite graphs (Q690667) (← links)
- Low-complexity error correction of Hamming-code-based LDPC codes (Q734298) (← links)
- Decoding concatenated codes with inner convolutional codes (Q1280739) (← links)
- On codes from hypergraphs. (Q1427432) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- Error correcting codes from sub-exceeding functions (Q2209497) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- Eigenvalue bounds on the pseudocodeword weight of expander codes (Q2470810) (← links)
- Exact Random Coding Error Exponents of Optimal Bin Index Decoding (Q2986086) (← links)
- The Minimum Distance of Graph Codes (Q3005590) (← links)
- (Q3695172) (← links)
- (Q4063331) (← links)
- (Q4343040) (← links)
- Explicit rateless codes for memoryless binary-input output-symmetric channels (Q4568110) (← links)
- Average and reliability error exponents in low-density parity-check codes (Q5696401) (← links)
- Code Offset in the Exponent. (Q6107266) (← links)
- Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\) (Q6113103) (← links)
