Skip to main content
SpringerLink
Log in

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

Generalized minimum distance (GMD) decoders allow for combining some virtues of probabilistic and algebraic decoding approaches at a low complexity. We investigate single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff, based on either erasing a fraction of the received symbols or erasing all symbols whose reliability values are below a certain threshold. The fraction/threshold may be either static or adaptive, where adaptive means that the erasing is a function of the channel output. Adaptive erasing based on a threshold is a new technique that has not been investigated before. An asymptotic approach is used to evaluate the error-correction radius for each strategy. Both known and new results appear as special cases of this general framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Forney, G.D., Jr., Generalized Minimum Distance Decoding, IEEE Trans. Inform. Theory, 1966, vol. 12, no. 2, pp. 125–131.

    Article  MathSciNet  MATH  Google Scholar 

  2. Forney, G.D., Jr., Concatenated Codes, Cambridge: MIT Press, 1966. Translated under the title Kaskadnye kody, Moscow: Mir, 1970.

    Google Scholar 

  3. Kovalev, S.I., Two Classes of Minimum Generalized Distance Decoding Algorithms, Probl. Peredachi Inf., 1986, vol. 22, no. 3, pp. 35–42 [Probl. Inf. Trans. (Engl. Transl.), 1986, vol. 22, no. 3, pp. 186–192].

    MathSciNet  Google Scholar 

  4. Weber, J.H. and Abdel-Ghaffar, K.A.S., Reduced GMD Decoding, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 4, pp. 1013–1027.

    Article  MathSciNet  Google Scholar 

  5. Sidorenko, V.R., Chaaban, A., Senger, C., and Bossert, M., On Extended Forney-Kovalev GMD Decoding, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT’2009), Seoul, Korea, 2009, pp. 1393–1397.

  6. Sudan, M., Decoding of Reed Solomon Codes beyond the Error-Correction Bound, J. Complexity, 1997, vol. 13, no. 1, pp. 180–193.

    Article  MathSciNet  MATH  Google Scholar 

  7. Guruswami, V. and Sudan, M., Improved Decoding of Reed-Solomon and Algebraic-Geometry Codes, IEEE Trans. Inform. Theory, 1999, vol. 45, no. 6, pp. 1757–1767.

    Article  MathSciNet  MATH  Google Scholar 

  8. Schmidt, G., Sidorenko, V.R., and Bossert, M., Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 2991–3012.

    Article  MathSciNet  Google Scholar 

  9. Sidorenko, V., Senger, C., Bossert, M., and Zyablov, V., Single-Trial Decoding of Concatenated Codes Using Fixed or Adaptive Erasing, Adv. Math. Commun., 2010, vol. 4, no. 1, pp. 49–60.

    Article  MathSciNet  MATH  Google Scholar 

  10. Senger, C., Sidorenko, V.R., Bossert, M., and Zyablov, V.V., Optimal Thresholds for GMD Decoding with (λ+1)/λ-Extended Bounded Distance Decoders, in Proc. 2010 IEEE Int. Sympos. on Information Theory (ISIT’2010), Austin, TX, USA, 2010, pp. 1100–1104.

  11. Senger, C., Sidorenko, V.R., Bossert, M., and Zyablov, V.V., Multi-Trial Decoding of Concatenated Codes Using Fixed Thresholds, Probl. Peredachi Inf., 2010, vol. 46, no. 2, pp. 30–46 [Probl. Inf. Trans. (Engl. Transl.), 2010, vol. 46, no. 2, pp. 127–141].

    MathSciNet  Google Scholar 

  12. Senger, C., Sidorenko, V.R., Bossert, M., and Zyablov, V.V., Optimal Threshold-Based Multi-Trial Error/Erasure Decoding with the Guruswami-Sudan Algorithm, in Proc. 2011 IEEE Int. Sympos. on Information Theory (ISIT’2011), St. Petersburg, Russia, 2011, pp. 845–849.

Download references

Author information

Authors and Affiliations

  1. Delft University of Technology, Delft, The Netherlands

    J. H. Weber

  2. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    V. R. Sidorenko

  3. Ulm University, Ulm, Germany

    V. R. Sidorenko & C. Senger

  4. University of California, Davis, CA, USA

    K. A. S. Abdel-Ghaffar

Authors
  1. J. H. Weber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. R. Sidorenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Senger
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. K. A. S. Abdel-Ghaffar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. H. Weber.

Additional information

Original Russian Text © J.H. Weber, V.R. Sidorenko, C. Senger, K.A.S. Abdel-Ghaffar, 2012, published in Problemy Peredachi Informatsii, 2012, Vol. 48, No. 4, pp. 30–40.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weber, J.H., Sidorenko, V.R., Senger, C. et al. Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff. Probl Inf Transm 48, 324–333 (2012). https://doi.org/10.1134/S0032946012040023

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946012040023

Keywords

Search

Navigation