Abstract
The moment problem related to the extended Lotka–Volterra system (sometimes also called the hungry Lotka–Volterra system or the Narita–Itoh–Bogoyavlensky lattice) over finite fields is introduced. It turns out the moment problem could be used to design an algorithm for decoding multiple BCH-Goppa codes over the same finite field simultaneously. When multiple codes have the same error locations, the algorithm requires fewer known syndromes and has lower computational complexity than running the decoding algorithm in Nakamura (1996 Phys. Lett. A 223 75–81) multiple times.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Physics A: Mathematical and Theoretical
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
