The following pages link to Expander codes (Q3129457):
Displaying 50 items.
- Combinatorial PCPs with short proofs (Q260390) (← links)
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Symmetric unique neighbor expanders and good LDPC codes (Q335354) (← links)
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders (Q352121) (← links)
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Composition of semi-LTCs by two-wise tensor products (Q496304) (← links)
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) (Q514531) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth (Q543230) (← links)
- Eigenvalues and expansion of bipartite graphs (Q690667) (← links)
- Low-complexity error correction of Hamming-code-based LDPC codes (Q734298) (← links)
- LDPC codes generated by conics in the classical projective plane (Q851763) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- Hamiltonian paths in Cayley graphs (Q1044918) (← links)
- An optimal lower bound for 2-query locally decodable linear codes (Q1045948) (← 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)
- Expander \(\ell_0\)-decoding (Q1669068) (← links)
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage (Q1726264) (← links)
- Some ``good'' properties of LDA lattices (Q1752293) (← links)
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases (Q1945151) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- Model counting with error-correcting codes (Q2009186) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- Some low-density parity-check codes derived from finite geometries (Q2267793) (← links)
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions (Q2291671) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Optimal codes as Tanner codes with cyclic component codes (Q2350924) (← links)
- Shift lifts preserving Ramanujan property (Q2361560) (← links)
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles (Q2383983) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- Computation of best possible low degree expanders (Q2462391) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Using low-density parity-check codes to improve the McEliece cryptosystem (Q2658068) (← links)
- Geometric structures in group theory. Abstracts from the workshop held February 27 -- March 5, 2022 (Q2693038) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Cayley sum graphs and their applications to codebooks (Q2697479) (← links)
- On the spectral distribution of large weighted random regular graphs (Q2935252) (← links)
- The Minimum Distance of Graph Codes (Q3005590) (← links)
- Expander graphs in pure and applied mathematics (Q3109810) (← links)
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds (Q3189929) (← links)
- Photonic circuits for iterative decoding of a class of low-density parity-check codes (Q3387054) (← links)
- Geometric Constructions of Gallager Codes (Q3448748) (← links)
- Quantum Locally Testable Codes (Q3449558) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
