Abstract
In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding with the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have