3 problems
- 0 votes0 replies1 view
Hou et al.'s capacity-achieving conjecture for VAMP decoding of sparse superposition codes
Let SS denote sparse superposition coding with right orthogonally invariant design matrices, and suppose that the design matrices satisfy the spectra criterion. Hou et al.'s conjec…
- 0 votes0 replies0 views
Improved coupling-window bound for threshold saturation
Let be the size of the coupling window, let be the true error floor, let , and let denote the relevant free-energy gap in the uncoup…
- 0 votes0 replies0 views
Potential minimizer conjecture for generalized sparse superposition codes
Let be the potential associated with the state-evolution recursion for sparse superposition codes, and let … For a memoryless output channel with law ,…