Expander codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Good quantum LDPC codes with linear time decoders
- NLTS Hamiltonians from good quantum codes
- Isoperimetry in integer lattices
- Locally computable UOWHF with linear shrinkage
- Pseudorandom linear codes are list-decodable to capacity
- Good Expander Graphs and Expander Codes: Parameters and Decoding
- Hardness magnification near state-of-the-art lower bounds
- Proving as fast as computing: succinct arguments with constant prover overhead
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Code Offset in the Exponent.
- Geometric structures in group theory. Abstracts from the workshop held February 27 -- March 5, 2022
- Efficient proofs of retrievability using expander codes
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Shift lifts preserving Ramanujan property
- Sparse high dimensional expanders via local lifts
- When can an expander code correct (n) errors in O(n) time?
- On the spectral distribution of large weighted random regular graphs
- Using low-density parity-check codes to improve the McEliece cryptosystem
- Cayley sum graphs and their applications to codebooks
- Expander graph arguments for message-passing algorithms
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Symmetric LDPC codes and local testing
- Random Schreier graphs as expanders
- On the computational overhead of MPC with dishonest majority
- Parity check matrices and product representations of squares
- Error Exponents of Expander Codes under Linear-Complexity Decoding
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Limitation on the Rate of Families of Locally Testable Codes
- Computational sample complexity and attribute-efficient learning
- Geometric constructions of Gallager codes
- Weight distribution and decoding of codes on hypergraphs
- A new formula for the minimum distance of an expander code
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Efficient and reliable overlay networks for decentralized federated learning
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Eigenvalues and expansion of bipartite graphs
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- Combinatorial PCPs with short proofs
- Phase transitions of structured codes of graphs
- Graph theoretic error-correcting codes
- Codes on graphs: Recent progress
- Efficient decoding of random errors for quantum expander codes
- On encoding symbol degrees of array BP-XOR codes
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- A construction of combinatorial NLTS
- Strong blocking sets and minimal codes from expander graphs
- High dimensional random walks and colorful expansion
- Low-complexity error correction of Hamming-code-based LDPC codes
- The complexity of error-correcting codes
- A quadratic lower bound for three-query linear locally decodable codes over any field
- The minimum distance of graph codes
- Model counting with error-correcting codes
- On Tanner codes: Minimum distance and decoding
- Submodular functions: learnability, structure, and optimization
- Decoding concatenated codes with inner convolutional codes
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- Expander graphs, strong blocking sets and minimal codes (extended abstract)
- High-girth near-Ramanujan graphs with lossy vertex expansion
- Polynomial data structure lower bounds in the group model
- Computation of best possible low degree expanders
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Hardness of approximating the closest vector problem with pre-processing
- On the minimum depth of circuits with linear number of wires encoding good codes
- Random shortening of linear codes and applications
- Some ``good properties of LDA lattices
- Stability of homomorphisms, coverings and cocycles. I: Equivalence
- Low-density parity-check codes achieve list-decoding capacity
- Zig-zag and replacement product graphs and LDPC codes
- Optimal codes as Tanner codes with cyclic component codes
- Linear-time decoding of regular expander codes
- Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
- Inferring Sparse Preference Lists from Partial Information
- Cups and gates. I: Cohomology invariants and logical quantum operations
- Local and global expansion in random geometric graphs
- scientific article; zbMATH DE number 515917 (Why is no real title available?)
- Robust quantum entanglement at (nearly) room temperature
- A construction of random bigraphs and their application to error correction codes
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- On graph-based codes over Ramanujan graphs: existence and design of infinite families
- The expansion factor of error-control codes
- Symmetric unique neighbor expanders and good LDPC codes
- Local correctability of expander codes
- Codes from Expander Graphs
- Expander \(\ell_0\)-decoding
- Improved Nearly-MDS Expander Codes
- Hardness magnification near state-of-the-art lower bounds
- On codes from hypergraphs.
- Local correctability of expander codes
- Spectral geometry, link complements and surgery diagrams
- Decoding of Expander Codes at Rates Close to Capacity
- Global eigenvalue fluctuations of random biregular bipartite graphs
- Redundancy of codes with graph constraints
- Explicit constructions of asymptotic families of constant degree expander graphs from AG codes
- On the second eigenvalue of random bipartite biregular graphs
- Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
- Linear time decoding of regular expander codes
- LDPC codes based on algebraic graphs
- On the sizes of expander graphs and minimum distances of graph codes
- Symmetric LDPC codes and local testing
This page was built for publication: Expander codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129457)
