Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{148084,
        author = {SHREYA D. POTEY and PIYUSH M. DHANDE},
        title = {Review on Error Detection and Correction Capability for BCH Code and Reed-Solomon Code},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {5},
        number = {12},
        pages = {403-406},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=148084},
        abstract = {The BCH code is the essential class of multiple-error-correcting linear cyclic code. In actually,Bose-Chaudhuri-Hocqunghem code is an abstraction of the cyclic hamming code for multiple-error correction. The finding of errors made by noise during transmission from the sender to the recipient is called as Error Detection. The finding of errors and renewal of the original data is called as Error Correction.In this review paper shows that the studies about fixed block length and message length of the BCH code and Reed-Solomon code. In addition, the various techniques for decoding the codes are studied.},
        keywords = {BCH (Bose-Chaudhari-Hocqenghem) code; BCH Encoder; BCH Decoder; VHDL; Error Correction; BER (Bit Error Rate)},
        month = {},
        }