An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem.
Saved in:
| Title: | An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem. |
|---|---|
| Authors: | Pan, Yan1 (AUTHOR), Chang, Xiang‐Ke2,3 (AUTHOR) changxk@lsec.cc.ac.cn, Hu, Xing‐Biao2,3 (AUTHOR) |
| Source: | Studies in Applied Mathematics. Aug2023, Vol. 151 Issue 2, p450-474. 25p. |
| Subjects: | Lotka-Volterra equations, Iterative decoding, Finite fields, Decoding algorithms, Computational complexity |
| Abstract: | In this paper, the decoding problem for multiple Bose–Chaudhuri–Hocquenghem (BCH)‐Goppa codes over the same finite field is investigated. A new iterative decoding algorithm is proposed based on the quotient difference (qd)‐type discrete hungry Lotka–Volterra equation over finite fields. Compared with certain existing algorithms, the proposed algorithm manifests its advantage in computational complexity. A few of examples are presented to demonstrate its efficiency. [ABSTRACT FROM AUTHOR] |
| Copyright of Studies in Applied Mathematics is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper, the decoding problem for multiple Bose–Chaudhuri–Hocquenghem (BCH)‐Goppa codes over the same finite field is investigated. A new iterative decoding algorithm is proposed based on the quotient difference (qd)‐type discrete hungry Lotka–Volterra equation over finite fields. Compared with certain existing algorithms, the proposed algorithm manifests its advantage in computational complexity. A few of examples are presented to demonstrate its efficiency. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00222526 |
| DOI: | 10.1111/sapm.12584 |
