On expander codes
From MaRDI portal
Recommendations
Cited in
(39)- A new formula for the minimum distance of an expander code
- Eigenvalues and expansion of bipartite graphs
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Phase transitions of structured codes of graphs
- Parallel error correcting codes
- Efficient decoding of random errors for quantum expander codes
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Low-complexity error correction of Hamming-code-based LDPC codes
- The minimum distance of graph codes
- Decoding concatenated codes with inner convolutional codes
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
- scientific article; zbMATH DE number 5010757 (Why is no real title available?)
- Low-density parity-check codes achieve list-decoding capacity
- Optimal codes as Tanner codes with cyclic component codes
- Linear-time decoding of regular expander codes
- scientific article; zbMATH DE number 515917 (Why is no real title available?)
- The edge code of hypergraphs
- Local correctability of expander codes
- Improved Nearly-MDS Expander Codes
- On codes from hypergraphs.
- Local correctability of expander codes
- Decoding of Expander Codes at Rates Close to Capacity
- Linear time decoding of regular expander codes
- Multilevel expander codes
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Improving the Alphabet-Size in Expander-Based Code Constructions
- scientific article; zbMATH DE number 1552123 (Why is no real title available?)
- LP decoding of codes with expansion parameter above \(2/3\)
- On decoding Cohen-Haeupler-Schulman tree codes
- Good Expander Graphs and Expander Codes: Parameters and Decoding
- Code Offset in the Exponent.
- Efficient proofs of retrievability using expander codes
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- When can an expander code correct (n) errors in O(n) time?
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Expander graph arguments for message-passing algorithms
- Random Schreier graphs as expanders
- Error Exponents of Expander Codes under Linear-Complexity Decoding
- scientific article; zbMATH DE number 7759458 (Why is no real title available?)
This page was built for publication: On expander codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544525)
