Author/Authors :
Nabipour، Saeideh نويسنده Technical Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran , , Javidan، Javad نويسنده Technical Engineering Department, University of Mohaghegh Ardabili , , Zare Fatin، Gholamreza نويسنده Technical Engineering Department, University of Mohaghegh Ardabili, Ardabil, Iran ,
Abstract :
Error Correction Code is very important in modern communication systems. BCH (Bose, Chaudhuri, and Hocqunghem) codes are being widely used in variety communication and storage systems. In this paper the construction and decoding BCH codes which are based on finite field arithmetic is introduced and also an improved algorithm for finding roots of polynomials over finite fields is proposed. This makes possible significant speed up of the decoding process of BCH codes.
