Tightened upper bounds on the ML decoding error probability of binary linear block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 714-718

  Twitto, Moshe ^a   Sason, Igal ^a   Shamai, Shlomo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY LINEAR BLOCK CODES; OUTPUT-SYMMETRIC COMMUNICATION CHANNEL;

BLOCK CODES; DECODING; ERROR ANALYSIS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

BINARY CODES;

EID: 39049091951     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261625     Document Type: Conference Paper

References (15)

1. D. Divsalar, "A simple tight bound on error probablity of block codes with applications to turbo codes," TMO progress report, 42-139 NASA, JPL, Pasadena, CA, USA, November 1999
2. T. M. Duman and M. Salehi,"New performance bounds for turbo codes,"IEEE trans. on Communications, vol. 46, no. 6, pp. 717-723, June 1998.
3. T. M. Duman,"Turbo codes and turbo coded modulation systems: Analysis and performance bounds," Ph.D. dissertation, Elect. Comput. End. Dep., Northeastern University, Boston, MA, USA, May 1998.
4. R. G. Gallager,"Low-Density Parity-Check Codes," Cambridge, MA, USA, MIT press, 1963.
5. R. G. Gallager, "A simple derivation of the coding theorem and some applications,"IEEE Trans. on Information Theory, vol. 11, no. 1, pp. 3-18, January 1965
6. H. Herzberg and G. Poltyrev, "Techniques of bounding the probability of decoding error for block modulation structures", IEEE trans. on Information Theory, vol. 40, no. 3, pp. 903-911, May 1994.
7. G. Miller and D. Burshtein, "Bounds on the ML decoding error probability of LDPC codes," IEEE Trans. on Information Theory, vol. 47, no. 7, pp. 2696-2710, November 2001.
8. G. Poltyrev, "Bounds on the decoding error probability of linear binary codes via their spectra," IEEE Trans. on Information Theory, vol. 40, pp. 1284-1292, July 1994.
9. I. Sason and S. Shamai, "Improved upper bounds on the ML decoding error probability of parallel and serial concatenated Turbo codes via their ensemble distance spectrum," IEEE Trans. on Information Theory, vol. 46, no. 1, pp. 24-47, January 2000.
10. _, "On Improved bounds on decoding error probability of block codes over interleaved fading channels, with applications to Turbo-like codes," IEEE Trans. on Information Theory, vol. 47, no. 6, pp. 2275-2299, September 2001.
11. _, "Performance analysis of linear codes under maximum-likelihood decoding: a tutorial," submitted to Foundations and Trends in Communications and Information Theory, NOW Publishers, Delft, the Netherlands, December 2005.
12. I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channels," IEEE Trans. on Information Theory, vol. 49, no. 7, pp. 1611-1635, July 2003.
13. N. Shulman and M. Feder, "Random coding techniques for nonrandom codes," IEEE Trans. on Information Theory, vol. 45, no. 6, pp. 2101-2104, September 1999.
14. S. Shamai and I. Sason, "Variations on the Gallager bounds, connections, and applications, " IEEE Trans. on Information Theory, vol. 48, no. 12, pp. 3029-3051, December 2002.
15. M. Twitto, I. Sason and S. Shamai, "Tightened upper bounds on the ML decoding error probability of binary linear codes," submitted to IEEE Trans. on Information Theory.