The following pages link to On expander codes (Q4544525):
Displaying 15 items.
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← 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)
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage (Q1726264) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Optimal codes as Tanner codes with cyclic component codes (Q2350924) (← links)
- Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← links)
- The Minimum Distance of Graph Codes (Q3005590) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- (Q5874542) (← links)
- A new formula for the minimum distance of an expander code (Q5884135) (← links)
