An efficient decoding of RS-BCH product codes using hybrid root-finding of the polynomial over finite fields

This paper proposes an efficient decoding method of product codes with component codes being BCH and Reed-Solomon codes characterized by low complexity and latency achieved through parallel computation and the hybrid approach to solving the error locator polynomial over finite fields. The proposed method can be implemented on low-cost hardware platforms, making it suitable for applications in communication systems that highly require reliability and latency.