Corpus ID: 14115013

Upper Bounds On the ML Decoding Error Probability of General Codes over AWGN Channels

@article{Zhuang2013UpperBO,
  title={Upper Bounds On the ML Decoding Error Probability of General Codes over AWGN Channels},
  author={Qiutao Zhuang and Jia Liu and Xiao Ma},
  journal={ArXiv},
  year={2013},
  volume={abs/1308.3303}
}
In this paper, parameterized Gallager's first bounding technique (GFBT) is presented by introducing nested Gallager regions, to derive upper bounds on the ML decoding error probability of general codes over AWGN channels. The three well-known bounds, namely, the sphere bound (SB) of Herzberg and Poltyrev, the tangential bound (TB) of Berlekamp, and the tangential-sphere bound (TSB) of Poltyrev, are generalized to general codes without the properties of geometrical uniformity and equal energy… Expand
2 Citations
Bounds on the ML Decoding Error Probability of RS-Coded Modulation over AWGN Channels
  • 2
  • PDF
How Simple Can lt Be to Construct Good Codes
  • X. Ma
  • Computer Science
  • 2014
  • PDF

References

SHOWING 1-10 OF 40 REFERENCES
A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference
  • 43
  • PDF
New techniques for upper-bounding the MLD performance of binary linear codes
  • Xiao Ma, Jia Liu, B. Bai
  • Mathematics, Computer Science
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
  • 7
Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference
  • 28
  • PDF
New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes
  • 26
  • PDF
Bounds on the decoding error probability of binary linear codes via their spectra
  • G. Poltyrev
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1994
  • 218
  • Highly Influential
Upper bounds to error probabilities of coded systems beyond the cutoff rate
  • 61
  • PDF
New performance bounds for turbo codes
  • 78
...
1
2
3
4
...