On multi-trial Forney-Kovalev decoding of concatenated codes
Anas Chaaban, Vladimir R. Sidorenko, Christian Senger · Advances in Mathematics of Communications · 2014
A concatenated code $\mathcal{C} $ based on an inner code with Hamming distance $d^i$ and an outer code with Hamming distance $d^o$ is considered. An outer decoder that corrects $\varepsilon$ errors and $\theta$ erasures with high probability if $\lambda \varepsilon + \theta \le d^o - 1,$ where a real number $11$.