Rational maps and maximum likelihood decodings
From MaRDI portal
(Redirected from Rational maps and maximum likelihood decodings)
Abstract: This paper studies maximum likelihood(ML) decoding in error-correcting codes as rational maps and proposes an approximate ML decoding rule by using a Taylor expansion. The point for the Taylor expansion, which will be denoted by in the paper, is properly chosen by considering some dynamical system properties. We have two results about this approximate ML decoding. The first result proves that the order of the first nonlinear terms in the Taylor expansion is determined 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 better performance than that of BCH codes, and indicate that this proposed method approximates the original ML decoding very well.
Recommendations
Cites work
- A Mathematical Theory of Communication
- Algebraic geometric codes. Basic notions
- Fundamentals of Error-Correcting Codes
- Good error-correcting codes based on very sparse matrices
- scientific article; zbMATH DE number 1284423 (Why is no real title available?)
- scientific article; zbMATH DE number 194422 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Information Geometry of Turbo and Low-Density Parity-Check Codes
- Introduction to Applied Nonlinear Dynamical Systems and Chaos
- Modern Coding Theory
This page was built for publication: Rational maps and maximum likelihood decodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692031)