MathDB1 problem
- 0 votes0 replies0 views
Necessity conjecture for achievable soft-DF-BP rates
Let soft-DF-BP operate with codes confined to sequences of “good” codes. Let the conditions of the source's Theorem formalize sufficient conditions for a rate to be achievable with…