Phase transitions of structured codes of graphs
From MaRDI portal
Publication:6561324
Recommendations
Cites work
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 1559531 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- scientific article; zbMATH DE number 3276424 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- A Density Corrádi–Hajnal Theorem
- A recursive approach to low complexity codes
- Algebraic coding theory
- Asymptotically good Quantum and locally testable classical LDPC codes
- Decoding of Expander Codes at Rates Close to Capacity
- Dependent random choice
- Distance properties of expander codes
- Expander codes
- Finite topologies and Hamiltonian paths
- Graph-codes
- Locally testable codes with constant rate, distance, and locality
- On a problem of K. Zarankiewicz
- On expander codes
- On perfect one-factorization of the complete graph \(K_{2p}\)
- On the Minimal Density of Triangles in Graphs
- On the structure of linear graphs
- Structured Codes of Graphs
- Tensor products of weakly smooth codes are robust
- 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
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)
