Reed-Solomon Galois Field Generator Polynomial Block length Bit Error Rate Signal Noise Ratio

Abstract

In the present world, communication system which includes wireless, satellite and space communication, reducing error is being critical. During message transferring the data might get corrupted, so high bit error rate of the wireless communication system requires employing to sundry coding methods for transferring the data. Channel coding for detection and rectification of error avails the communication systems design to reduce the noise effect during transmission. The purport of this paper is to study and analyze the performance and efficiency of Reed-Solomon (RS) Codes. In coding theory, Reed-Solomon (RS) codes are the subset of BCH codes that are one of the most potent kenned classes of linear cyclic block codes. Reed-Solomon (RS) codes are very efficient and best for rectification of burst errors and have a wide range of applications in digital communication and data storage. Reed-Solomon (RS) is the most potent technique utilized for error detection and rectification at present.

Keywords: Reed-Solomon (RS); Galois Field (GS); Generator Polynomial g(x); Block length; Bit Error Rate (BER); Signal Noise Ratio (SNR).