Pages that link to "Item:Q4544508"
From MaRDI portal
The following pages link to Improved low-density parity-check codes using irregular graphs (Q4544508):
Displaying 19 items.
- Parallel finite element technique using Gaussian belief propagation (Q314011) (← links)
- Symmetric LDPC codes and local testing (Q519972) (← links)
- Finding most likely solutions (Q733750) (← links)
- LDPC code design for nonuniform power-line channels (Q836380) (← links)
- Parallel versus sequential updating for belief propagation decoding (Q1412924) (← links)
- Protograph LDPC code design for asynchronous random access (Q2005577) (← links)
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
- Photonic circuits for iterative decoding of a class of low-density parity-check codes (Q3387054) (← links)
- ENTANGLEMENT-ASSISTED QUANTUM ERROR-CORRECTING CODES CONSTRUCTED FROM IRREGULAR REPEAT ACCUMULATE CODES (Q3401036) (← links)
- Geometric Constructions of Gallager Codes (Q3448748) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Theory and applications of Raptor codes (Q4687423) (← links)
- Symmetric LDPC Codes and Local Testing (Q4933383) (← links)
- Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
- LDPC Codes Based on Algebraic Graphs (Q5406683) (← links)
- (Q5453272) (← links)
- Codes on graphs: Recent progress (Q5951414) (← links)
- Iterative decoding of LDPC codes: some bounds and properties (Q5951417) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)