Abstract
AbstractIn 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
