3 problems
- 0 votes0 replies0 views
The fundamental trade-off conjecture for expander-code decoding
Let be a -bipartite expander and let be an inner code with minimum Hamming distance . Let…
- 0 votes0 replies0 views
The integer-cohomology conjecture for Ramanujan complexes
Integer-cohomology conjecture. The dominant part of comes from the free part rather than the torsion part…
- 0 votes0 replies0 views
The stronger minimum pseudocodeword weight bound for expander codes
Stronger pseudocodeword weight conjecture. The resulting LDPC code has