MathDBNecessity conjecture for achievable soft-DF-BP rates
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 soft-DF-BP. Soft-DF-BP rate conjecture. Those conditions are necessary as well as sufficient for a rate to be achievable with soft-DF-BP. The conjecture would characterize the achievable rates of soft-DF-BP under the good-code restriction, whereas the source establishes only sufficiency of the stated conditions; no resolution is given.
Sources & referencesView supporting material
Primary source
Amir Bennatan, Shlomo Shamai and A. Robert Calderbank, “Soft-Decoding-Based Strategies for Relay and Interference Channels: Analysis and Achievable Rates Using LDPC Codes”, arXiv:1008.1766 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.