Work

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

Year: 2024

Type: article

Abstract: 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.

Source: Journal of Military Science and Technology

DOI: 10.54939/1859-1043.j.mst.csce8.2024.14-23

Authors: Pham Khac Hoan, Lai Tien De, Hoang Van Dung, Vu Son Ha

Institution: Le Quy Don Technical University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4406128087

FWCI:

Cites: 12

Cited by:

Related to: 10