Expander codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Zig-zag and replacement product graphs and LDPC codes
- Weight distribution and decoding of codes on hypergraphs
- Hamiltonian paths in Cayley graphs
- An optimal lower bound for 2-query locally decodable linear codes
- Decoding concatenated codes with inner convolutional codes
- On codes from hypergraphs.
- On Tanner codes: Minimum distance and decoding
- Expander \(\ell_0\)-decoding
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Some ``good properties of LDA lattices
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Some combinatorial aspects of constructing bipartite-graph codes
- Model counting with error-correcting codes
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Some low-density parity-check codes derived from finite geometries
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
- Local correctability of expander codes
- Optimal codes as Tanner codes with cyclic component codes
- Shift lifts preserving Ramanujan property
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Locally computable UOWHF with linear shrinkage
- On the sizes of expander graphs and minimum distances of graph codes
- Computation of best possible low degree expanders
- Combinatorial PCPs with short proofs
- A quadratic lower bound for three-query linear locally decodable codes over any field
- Using low-density parity-check codes to improve the McEliece cryptosystem
- On encoding symbol degrees of array BP-XOR codes
- Geometric structures in group theory. Abstracts from the workshop held February 27 -- March 5, 2022
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Cayley sum graphs and their applications to codebooks
- Linear time decoding of regular expander codes
- On the spectral distribution of large weighted random regular graphs
- Linear-time decoding of regular expander codes
- The minimum distance of graph codes
- Expander graphs in pure and applied mathematics
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Symmetric unique neighbor expanders and good LDPC codes
- Multilevel expander codes
- Photonic circuits for iterative decoding of a class of low-density parity-check codes
- Explicit constructions of asymptotic families of constant degree expander graphs from AG codes
- Geometric constructions of Gallager codes
- Quantum locally testable codes
- Expander graphs and their applications
- Expansion in SL₂( R) and monotone expanders
- Codes from Expander Graphs
- Decoding of Expander Codes at Rates Close to Capacity
- Improved Nearly-MDS Expander Codes
- Improving the Alphabet-Size in Expander-Based Code Constructions
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- scientific article; zbMATH DE number 515917 (Why is no real title available?)
- Hardness of approximating the closest vector problem with pre-processing
- Good Expander Graphs and Expander Codes: Parameters and Decoding
- scientific article; zbMATH DE number 1552123 (Why is no real title available?)
- Expander graph arguments for message-passing algorithms
- On expander codes
- Submodular functions: learnability, structure, and optimization
- High dimensional random walks and colorful expansion
- Isoperimetry in integer lattices
- Error Exponents of Expander Codes under Linear-Complexity Decoding
- The expansion factor of error-control codes
- Limitation on the Rate of Families of Locally Testable Codes
- Symmetric LDPC codes and local testing
- Composition of semi-LTCs by two-wise tensor products
- Low-density parity-check codes achieve list-decoding capacity
- Hardness magnification near state-of-the-art lower bounds
- The complexity of error-correcting codes
- Polynomial data structure lower bounds in the group model
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Hardness magnification near state-of-the-art lower bounds
- Efficient and reliable overlay networks for decentralized federated learning
- Inferring Sparse Preference Lists from Partial Information
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Symmetric LDPC codes and local testing
- Efficient decoding of random errors for quantum expander codes
- Local correctability of expander codes
- LDPC codes based on algebraic graphs
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- Graph theoretic error-correcting codes
- On the computational overhead of MPC with dishonest majority
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- A construction of combinatorial NLTS
- A new formula for the minimum distance of an expander code
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Computational sample complexity and attribute-efficient learning
- Codes on graphs: Recent progress
- Iterative decoding of LDPC codes: some bounds and properties
- Spectral geometry, link complements and surgery diagrams
- Global eigenvalue fluctuations of random biregular bipartite graphs
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Simple Codes and Sparse Recovery with Fast Decoding
- Code Offset in the Exponent.
- Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- On the second eigenvalue of random bipartite biregular graphs
- Efficient proofs of retrievability using expander codes
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Local and global expansion in random geometric graphs
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)
