Reduced-Complexity Quasi-Reversible BCH Decoders for Data Storage Systems
Chong‐Dao Lee · 2021
Error-correcting codes, including Bose-Chaudhuri-Hocquenghem (BCH) codes, low-density parity-check codes, and Reed-Solomon codes have been widely applied to magnetic and data storage systems. Recently, a new subclass of BCH codes was proposed and called quasi-reversible BCH codes. This paper proposes the new error-locator polynomial, which is a sparse polynomial, requires the less finite field additions as well as multiplications, and is able to reduce time delay. Finally, the algebraic decoding algorithm for quasi-reversible BCH codes to correct up to six errors is developed.