Optimal input process achieves capacity up to fourth order for the deletion channel
Statement
Let be the deletion probability, let denote the capacity of the deletion channel, and let denote the input process constructed in the paper. The conjecture. The achievable rate of differs from capacity by a fourth-order term:
The preceding analysis establishes only the weaker estimate for every fixed . Proving the sharper fourth-order approximation would improve the asymptotic characterization of optimal coding for small deletion probability.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.