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.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 169809445 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Pan%2C+Yan%22">Pan, Yan</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Chang%2C+Xiang‐Ke%22">Chang, Xiang‐Ke</searchLink><relatesTo>2,3</relatesTo> (AUTHOR)<i> changxk@lsec.cc.ac.cn</i><br /><searchLink fieldCode="AR" term="%22Hu%2C+Xing‐Biao%22">Hu, Xing‐Biao</searchLink><relatesTo>2,3</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Studies+in+Applied+Mathematics%22">Studies in Applied Mathematics</searchLink>. Aug2023, Vol. 151 Issue 2, p450-474. 25p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Lotka-Volterra+equations%22">Lotka-Volterra equations</searchLink><br /><searchLink fieldCode="DE" term="%22Iterative+decoding%22">Iterative decoding</searchLink><br /><searchLink fieldCode="DE" term="%22Finite+fields%22">Finite fields</searchLink><br /><searchLink fieldCode="DE" term="%22Decoding+algorithms%22">Decoding algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=169809445 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1111/sapm.12584 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 25 StartPage: 450 Subjects: – SubjectFull: Lotka-Volterra equations Type: general – SubjectFull: Iterative decoding Type: general – SubjectFull: Finite fields Type: general – SubjectFull: Decoding algorithms Type: general – SubjectFull: Computational complexity Type: general Titles: – TitleFull: An application of a qd‐type discrete hungry Lotka–Volterra equation over finite fields to a decoding problem. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Pan, Yan – PersonEntity: Name: NameFull: Chang, Xiang‐Ke – PersonEntity: Name: NameFull: Hu, Xing‐Biao IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2023 Type: published Y: 2023 Identifiers: – Type: issn-print Value: 00222526 Numbering: – Type: volume Value: 151 – Type: issue Value: 2 Titles: – TitleFull: Studies in Applied Mathematics Type: main |
| ResultId | 1 |
