A New Upper Bound on the Error Probability of Binary Linear Codes

Jun Guo; Li Yun Dai; Hong Wen Yang

doi:10.4028/www.scientific.net/AMR.403-408.2852

Paper Titles

Punching Mould Quotation System Based on the Variable Step-Size BP Algorithm
p.2835

Cooperative Access Architecture for High Speed Railway
p.2839

Control Method for Myoelectric Prosthetic Hand’s Grip Force Based on Neural Network and Fuzzy Logic Controller
p.2843

Engine Torque Estimation Based on BP Neural Network
p.2848

A New Upper Bound on the Error Probability of Binary Linear Codes
p.2852

Analysis of Risk Transmission from Generation Right Trading to Generation Company Profit
p.2856

A Novel DOA Estimation Method for Wideband Signals
p.2861

Measurement of Structure’s Image Primitive Based on Power-Law
p.2866

Study on Knowledge Based Complex Product Development Process Management System
p.2870

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408A New Upper Bound on the Error Probability of...

A New Upper Bound on the Error Probability of Binary Linear Codes

Abstract:

Performance evaluation of maximum-likelihood (ML) decoded binary linear codes is usually carried out using bounding techniques. In this paper, a new upper bound is presented to improve existing union bounds. The proposed upper bounding is based on probabilities of correct events, while the traditional union bound (UB) is on pair-wise error probabilities. Moreover, the improved upper bounding uses the intersection instead of the union of basic events. The theoretical and simulation results show that the proposed bound is tight than UB.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2852-2855

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.403-408.2852

Citation:

Cite this paper

Online since:

November 2011

Authors:

Jun Guo, Li Yun Dai, Hong Wen Yang

Keywords:

Binary Linear Codes, Error Probability, Maximum-Likelihood (ML) Decoding, Union Bound (UB), Upper Bounds

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M. Twitto, I. Sason, and S. Shamai: Tightened upper bounds on the ML decoding error probability of binary linear block codes, IEEE Trans. Inf. Theory, vol. 53(2007), no. 4, p.1495–1510.

DOI: 10.1109/tit.2007.892807

Google Scholar

[2] S. Shamai and I. Sason: Variations on the gallager bounds, connections and applications, " IEEE Trans. Inf. Theory, vol. 48(2002), no. 12, p.3029–3051.

DOI: 10.1109/tit.2002.805064

Google Scholar

[3] G. Poltyrev: Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Trans. Inf. Theory, vol. 40 (1994), no. 4, p.1284–1292.

DOI: 10.1109/18.335935

Google Scholar

[4] J. Galambos and I. Simonelli, in: Bonferroni-Type Inequlities With Applications, New York: Springer-Verlag(1996).

Google Scholar

[5] Xiao Ma, Jia Liu and Baoming Bai, in: New techniques for upper-bounding the ML decoding Performance of Binary Linear Codes, http: /arxiv. org/pdf/1104. 1471.

DOI: 10.1109/tcomm.2012.122712.120225

Google Scholar

[6] Zhengyan Lin and Zhidong Bai, in: Probability Inequlities. Beijing: Science Press(2010).

Google Scholar

[7] R. Honsberger, in: More Mathmatical Morsels. Washington, DC: Math. Assoc. Amer. (1991), pp.244-245.

Google Scholar