Title :
A tight upper bound on the BER of linear systematic block codes
Author :
Vitthaladevuni, Pavan Kumar ; Alouini, Mohamed-Slim
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA
fDate :
5/1/2004 12:00:00 AM
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 :
block codes; error statistics; linear codes; parity check codes; BER; linear systematic block codes; parity check matrices; quasiperfect codes; signal-to-noise ratio; syndrome decoding; union-Chernoff bound; upper bound; Bit error rate; Block codes; Channel coding; Computer errors; Decoding; Error correction codes; Intelligent transportation systems; Parity check codes; Redundancy; Upper bound; Block codes; parity check matrices; syndrome decoding; union-Chernoff bound;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2004.827386
