Phase transitions of structured codes of graphs

DOI10.1137/23m1614572zbMATH Open1542.05083MaRDI QIDQ6561324

Yuze Wu, Yu Gao, Jie Ma, Bo Bai

Publication date: 25 June 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal problemscoding theoryperfect 1-factorization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial codes (94B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On perfect one-factorization of the complete graph \(K_{2p}\)
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Finite topologies and Hamiltonian paths
• Dependent random choice
• Expander codes
• On the Minimal Density of Triangles in Graphs
• Distance properties of expander codes
• Decoding of Expander Codes at Rates Close to Capacity
• A recursive approach to low complexity codes
• The capacity of low-density parity-check codes under message-passing decoding
• On expander codes
• Algebraic Coding Theory
• A Density Corrádi–Hajnal Theorem
• Bounded degree cosystolic expanders of every dimension
• On a problem of K. Zarankiewicz
• On the structure of linear graphs
• Structured Codes of Graphs
• Locally testable codes with constant rate, distance, and locality
• Asymptotically good Quantum and locally testable classical LDPC codes
• Graph-codes

This page was built for publication: Phase transitions of structured codes of graphs