Skip to main content
Log in

Rational maps and maximum likelihood decodings

  • Original Paper
  • Area 1
  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

This paper studies maximum likelihood (ML) decoding in error-correcting codes as a rational map and proposes a new approximate ML decoding rule by using the Taylor expansion. The point for the Taylor expansion, which will be denoted by p in the paper, is properly chosen by considering some properties of the rational map dynamical systems. We have two results about this approximate ML decoding. The first result proves that the first nonlinear terms in the Taylor expansion are determined by linear dependent column vectors of a generator matrix. In particular, the order of the first nonlinearity is given by the minimum distance of its dual code. As the second result, we give numerical results on bit error probabilities for the approximate ML decoding. These numerical results show performances better than those of BCH codes, and indicate that this proposed method approximates the original ML decoding very well.

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

Access this article

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. Fulton, W.: Algebraic Curves: An Introduction to Algebraic Geometry. Addison Wesley Publishing Company (1989)

  2. Gallager R.G.: Information Theory and Reliable Communication. Wiley, New York (1968)

    MATH  Google Scholar 

  3. Gallager R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)

    Google Scholar 

  4. Høholdt T., van Lint J.H., Pellikaan R.: Algebraic geometry codes. In: Pless, V.S., Huffman, W.C (eds) Handbook of Coding Theory, vol. 2, pp. 871–961. Elsevier, Amsterdam (1998)

    Google Scholar 

  5. Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press (2003)

  6. Ikeda S., Tanaka T., Amari S.: Information geometry of turbo and low-density parity-check codes. IEEE Trans. Inform. Theory 50, 1097–1114 (2004)

    Article  MathSciNet  Google Scholar 

  7. Lin, S., Costello, D.J.: Error Control Coding, 2nd edn. Prentice Hall (2004)

  8. MacKay D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory 45, 399–431 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press (2008)

  10. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423, 623–656 (1948)

    Google Scholar 

  11. Stichtenoth H.: Algebraic function fields and codes In: Graduate Texts in Mathematics, 2nd edn. Springer, New York (2008)

    Google Scholar 

  12. Tsfasman, M., Vlǎduţ, S., Nogin, D.: Algebraic Geometric Codes: Basic Notions, Mathematical Surveys and Monographs, vol. 139. AMS

  13. Wiggins, S.: Introduction to applied nonlinear dynamical systems and chaos. Texts in Applied Mathematics, vol. 2. Springer, New York (2003)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yasuaki Hiraoka.

About this article

Cite this article

Hayashi, K., Hiraoka, Y. Rational maps and maximum likelihood decodings. Japan J. Indust. Appl. Math. 29, 37–62 (2012). https://doi.org/10.1007/s13160-011-0048-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13160-011-0048-7

Keywords

Mathematics Subject Classification (2000)

Navigation