The following pages link to (Q4526978):
Displayed 14 items.
- On encoding symbol degrees of array BP-XOR codes (Q267791) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- Random matrices and codes for the erasure channel (Q848850) (← links)
- Cayley-type graphs for group-subgroup pairs (Q896858) (← links)
- Reducing communication costs in robust peer-to-peer networks (Q963355) (← links)
- Pruning processes and a new characterization of convex geometries (Q1025925) (← links)
- MB iterative decoding algorithm on systematic LDGM codes: performance evaluation (Q1048821) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Theory and applications of Raptor codes (Q4687423) (← links)
- Generating Random Networks Without Short Cycles (Q4971560) (← links)
- (Q5075778) (← links)
- Almost all graphs with average degree 4 are 3-colorable (Q5917586) (← links)
- Codes on graphs: Recent progress (Q5951414) (← links)
- How to recover a secret with \(O(n)\) additions (Q6186593) (← links)