Phase transitions of structured codes of graphs
From MaRDI portal
Publication:6561324
DOI10.1137/23M1614572zbMATH Open1542.05083MaRDI QIDQ6561324FDOQ6561324
Authors: Bo Bai, Yu Gao, Jie Ma, Yuze Wu 
Publication date: 25 June 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25) Extremal set theory (05D05)
Cites Work
- Title not available (Why is that?)
- On the structure of linear graphs
- Tensor products of weakly smooth codes are robust
- Expander codes
- On a problem of K. Zarankiewicz
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- The capacity of low-density parity-check codes under message-passing decoding
- Dependent random choice
- Title not available (Why is that?)
- On the Minimal Density of Triangles in Graphs
- A recursive approach to low complexity codes
- Distance properties of expander codes
- On expander codes
- A Density Corrádi–Hajnal Theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic coding theory
- On perfect one-factorization of the complete graph \(K_{2p}\)
- Title not available (Why is that?)
- Finite topologies and Hamiltonian paths
- Structured Codes of Graphs
- Locally testable codes with constant rate, distance, and locality
- Decoding of Expander Codes at Rates Close to Capacity
- Asymptotically good Quantum and locally testable classical LDPC codes
- Graph-codes
Cited In (2)
This page was built for publication: Phase transitions of structured codes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561324)
