Finite-size error rate
Determine the finite-size error rate of the failure-conditioned measurement and coverage approximations for the ideal Plain IBLT peeling model.
References
The following questions are left for future work: the error rate at finite size; in the moving subcritical region with $|r_M|/\sqrt{\log M}\to\infty$, the relative probability and the fine conditional law of the macroscopic layer itself, a region beyond the scope of Proposition~\ref{prop:mda}, where the failure-conditioned law is dominated by the repeated-edge layer; the complete classification of the sparse end $d=O(\sqrt M)$; $k$ growing with the size; and non-ideal checksums and other mapping families.
The following questions are left for future work: the error rate at finite size; in the moving subcritical region with $|r_M|/\sqrt{\log M}\to\infty$, the relative probability and the fine conditional law of the macroscopic layer itself, a region beyond the scope of Proposition~\ref{prop:mda}, where the failure-conditioned law is dominated by the repeated-edge layer; the complete classification of the sparse end $d=O(\sqrt M)$; $k$ growing with the size; and non-ideal checksums and other mapping families.
The following questions are left for future work: the error rate at finite size; in the moving subcritical region with $|r_M|/\sqrt{\log M}\to\infty$, the relative probability and the fine conditional law of the macroscopic layer itself, a region beyond the scope of Proposition~\ref{prop:mda}, where the failure-conditioned law is dominated by the repeated-edge layer; the complete classification of the sparse end $d=O(\sqrt M)$; $k$ growing with the size; and non-ideal checksums and other mapping families.
The following questions are left for future work: the error rate at finite size; in the moving subcritical region with $|r_M|/\sqrt{\log M}\to\infty$, the relative probability and the fine conditional law of the macroscopic layer itself, a region beyond the scope of Proposition~\ref{prop:mda}, where the failure-conditioned law is dominated by the repeated-edge layer; the complete classification of the sparse end $d=O(\sqrt M)$; $k$ growing with the size; and non-ideal checksums and other mapping families.
This conclusion is a numerical verification; whether the shift order transfers to the Plain model still requires a separate proof.