Expander codes
From MaRDI portal
Publication:3129457
DOI10.1109/18.556667zbMath0943.94543OpenAlexW2293231900WikidataQ56806174 ScholiaQ56806174MaRDI QIDQ3129457
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
Related Items
On encoding symbol degrees of array BP-XOR codes, A construction of combinatorial NLTS, A new formula for the minimum distance of an expander code, Shift lifts preserving Ramanujan property, Geometric Constructions of Gallager Codes, Quantum Locally Testable Codes, The complexity of error-correcting codes, Linear-time list recovery of high-rate expander codes, A quadratic lower bound for three-query linear locally decodable codes over any field, Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles, LDPC codes generated by conics in the classical projective plane, Polynomial Data Structure Lower Bounds in the Group Model, Symmetric unique neighbor expanders and good LDPC codes, Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds, Expansion in SL\(_2(\mathbb R)\) and monotone expanders, Submodular Functions: Learnability, Structure, and Optimization, Using low-density parity-check codes to improve the McEliece cryptosystem, Expander \(\ell_0\)-decoding, On the spectral distribution of large weighted random regular graphs, Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders, Bounds on the minimum code distance for nonbinary codes based on bipartite graphs, Locally computable UOWHF with linear shrinkage, Efficient and Reliable Overlay Networks for Decentralized Federated Learning, 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, 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, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, On the second eigenvalue of random bipartite biregular graphs, Efficient proofs of retrievability using expander codes, Unnamed Item, Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases, Expander graphs and their applications, Constructions of strongly regular Cayley graphs derived from weakly regular bent functions, Hardness of approximating the closest vector problem with pre-processing, 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), Some combinatorial aspects of constructing bipartite-graph codes, Cayley sum graphs and their applications to codebooks, On codes from hypergraphs., On the sizes of expander graphs and minimum distances of graph codes, Unnamed Item, AC-RRNS: anti-collusion secured data sharing scheme for cloud storage, Inferring Sparse Preference Lists from Partial Information, Computation of best possible low degree expanders, Composition of semi-LTCs by two-wise tensor products, The Minimum Distance of Graph Codes, Isoperimetry in integer lattices, Parity check matrices and product representations of squares, LDPC Codes Based on Algebraic Graphs, On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\), Some ``good properties of LDA lattices, Symmetric LDPC codes and local testing, Eigenvalues and expansion of bipartite graphs, On the Computational Overhead of MPC with Dishonest Majority, Low complexity construction for quasi-cyclic low-density parity-check codes by progressive-block growth, Model counting with error-correcting codes, Limitation on the Rate of Families of Locally Testable Codes, Symmetric LDPC Codes and Local Testing, Some low-density parity-check codes derived from finite geometries, The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\), Codes on graphs: Recent progress, Iterative decoding of LDPC codes: some bounds and properties, Exponential lower bound for 2-query locally decodable codes via a quantum argument, Spectral geometry, link complements and surgery diagrams, Low-complexity error correction of Hamming-code-based LDPC codes, Computational sample complexity and attribute-efficient learning, Ramanujan graphs and expander families constructed from \(p\)-ary bent functions, Photonic circuits for iterative decoding of a class of low-density parity-check codes, Hardness magnification near state-of-the-art lower bounds, Decoding concatenated codes with inner convolutional codes, High Dimensional Random Walks and Colorful Expansion, Expander graphs in pure and applied mathematics, Hamiltonian paths in Cayley graphs, An optimal lower bound for 2-query locally decodable linear codes, Local correctability of expander codes, Low-Density Parity-Check Codes Achieve List-Decoding Capacity, Optimal codes as Tanner codes with cyclic component codes, Combinatorial PCPs with short proofs
