A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient

@article{Shen1996ABD,
  title={A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient},
  author={Ba-Zhong Shen and Kenneth K. Tzeng and Chun Wang},
  journal={IEEE Trans. Information Theory},
  year={1996},
  volume={42},
  pages={1987-1991}
}
A new bounded-distance (BD) decoding algorithm is presented for binary linear (n, k , d ) block codes on additive white Gaussian noise channels. The algorithm is based on the generalized minimum distance (GMD) decoding algorithm of Forney using the acceptance criterion of Taipale and Pursley (GMDRP). It is shown that the GMD/TP decoding algorithm is a BD decoding algorithm with effective error coefficient ( ). It is also shown that the decision regions of GMDRP are good inner approximations of… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Error-and-erasure decoding of binary cyclic codes up to actual minimum distance,

  • H. Lee, K. K. Tzeng, C. J. Chen
  • 1995

Fast error-and-ixasure decoding of any one-point AG codes up to Feng-Rao bound,

  • S . Sakata
  • IEEE Int. Symp. on Information
  • 1995

Fast bounded - distance decoding of the Nordstrom - Robinson code , ” in Communications and Cryptography ,

  • R. E. Blahut, D. J. Costello, U. Maurer, T. Mittelholzer
  • 1994

Similar Papers

Loading similar papers…