We present in this letter new upper bounds for linear and systematic block codes. Both perfect and quasi-perfect codes are considered. Numerical results show that our new bounds give much tighter results compared to the classical union-Chernoff bound. In addition, these bounds are more accurate than the leading term approximations especially at low signal-to-noise ratio.
['Pavan K. Vitthaladevuni', 'Mohamed-Slim Alouini']
A tight upper bound on the BER of linear systematic block codes