Expander codes
From MaRDI portal
Publication:3129457
DOI10.1109/18.556667zbMATH Open0943.94543DBLPjournals/tit/SipserS96OpenAlexW2293231900WikidataQ56806174 ScholiaQ56806174MaRDI QIDQ3129457FDOQ3129457
Authors: Michael Sipser, Daniel A. Spielman 
Publication date: 28 August 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5282c6604f88c24de20c23e6d9179d292c5cd694
Recommendations
Cited In (only showing first 100 items - show all)
- A new formula for the minimum distance of an expander code
- Efficient and reliable overlay networks for decentralized federated learning
- Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
- Weight distribution and decoding of codes on hypergraphs
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
- Eigenvalues and expansion of bipartite graphs
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Combinatorial PCPs with short proofs
- Codes on graphs: Recent progress
- Graph theoretic error-correcting codes
- Efficient decoding of random errors for quantum expander codes
- Title not available (Why is that?)
- A construction of combinatorial NLTS
- On encoding symbol degrees of array BP-XOR codes
- High dimensional random walks and colorful expansion
- The complexity of error-correcting codes
- Low-complexity error correction of Hamming-code-based LDPC codes
- A quadratic lower bound for three-query linear locally decodable codes over any field
- The minimum distance of graph codes
- Submodular functions: learnability, structure, and optimization
- Model counting with error-correcting codes
- On Tanner codes: Minimum distance and decoding
- Decoding concatenated codes with inner convolutional codes
- Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Some ``good properties of LDA lattices
- Hardness of approximating the closest vector problem with pre-processing
- Zig-zag and replacement product graphs and LDPC codes
- Improved Nearly-MDS Expander Codes
- Local correctability of expander codes
- Local correctability of expander codes
- Spectral geometry, link complements and surgery diagrams
- Symmetric unique neighbor expanders and good LDPC codes
- Expander \(\ell_0\)-decoding
- On codes from hypergraphs.
- On the second eigenvalue of random bipartite biregular graphs
- LDPC codes based on algebraic graphs
- Symmetric LDPC codes and local testing
- On the sizes of expander graphs and minimum distances of graph codes
- Some low-density parity-check codes derived from finite geometries
- Title not available (Why is that?)
- Iterative decoding of LDPC codes: some bounds and properties
- Hamiltonian paths in Cayley graphs
- Some combinatorial aspects of constructing bipartite-graph codes
- Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles
- Expansion in SL\(_2(\mathbb R)\) and monotone expanders
- Expander graphs in pure and applied mathematics
- LDPC codes generated by conics in the classical projective plane
- An optimal lower bound for 2-query locally decodable linear codes
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- On expander codes
- Ramanujan graphs and expander families constructed from \(p\)-ary bent functions
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Composition of semi-LTCs by two-wise tensor products
- Expander graphs and their applications
- Isoperimetry in integer lattices
- Hardness magnification near state-of-the-art lower bounds
- Geometric structures in group theory. Abstracts from the workshop held February 27 -- March 5, 2022
- Shift lifts preserving Ramanujan property
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- Using low-density parity-check codes to improve the McEliece cryptosystem
- On the computational overhead of MPC with dishonest majority
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Symmetric LDPC codes and local testing
- Parity check matrices and product representations of squares
- Error Exponents of Expander Codes under Linear-Complexity Decoding
- Computational sample complexity and attribute-efficient learning
- Limitation on the Rate of Families of Locally Testable Codes
- Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
- Geometric constructions of Gallager codes
- Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
- Phase transitions of structured codes of graphs
- Strong blocking sets and minimal codes from expander graphs
- Polynomial data structure lower bounds in the group model
- On the minimum depth of circuits with linear number of wires encoding good codes
- Random shortening of linear codes and applications
- Computation of best possible low degree expanders
- Low-density parity-check codes achieve list-decoding capacity
- Optimal codes as Tanner codes with cyclic component codes
- Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
- Inferring Sparse Preference Lists from Partial Information
- Linear-time decoding of regular expander codes
- Local and global expansion in random geometric graphs
- Title not available (Why is that?)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- The expansion factor of error-control codes
- Hardness magnification near state-of-the-art lower bounds
- Codes from Expander Graphs
- Global eigenvalue fluctuations of random biregular bipartite graphs
- Redundancy of codes with graph constraints
- Decoding of Expander Codes at Rates Close to Capacity
- Explicit constructions of asymptotic families of constant degree expander graphs from AG codes
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Linear time decoding of regular expander codes
- Constructions of strongly regular Cayley graphs derived from weakly regular bent functions
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Multilevel expander codes
- Improving the Alphabet-Size in Expander-Based Code Constructions
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Photonic circuits for iterative decoding of a class of low-density parity-check codes
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)
