A tight upper bound on the BER of linear systematic block codes |
| |
| Authors: | Vitthaladevuni PK Alouini M-S |
| |
| Affiliation: | Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA; |
| |
| Abstract: | 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. |
| |
| Keywords: | |
|
|
