Project Name: Reed-Solomon Decoder


On January 21, 1959, Irving Reed and Gus Solomon submitted a paper to the Journal of the Society for Industrial and Applied Mathematics. In June of 1960 the paper was published : five pages under the rather unpretentius title "Polynomial Codes over Certain Finite Fields". This paper describe a new class of error-correcting codes that are now called Reed-Solomon codes.

Reed-Solomon codes are block-based error correcting codes with a wide range of applications in digital communications and storage. Reed-Solomon codes are used to correct errors in many systems including: 

Reed Solomon codes are a subset of BCH codes and are linear block codes. A Reed-Solomon code is specified as RS(n,k) with s-bit symbols.

This means that the encoder takes k data symbols of s bits each and adds parity symbols to make an n symbol codeword. There are n-k parity symbols of s bits each. A Reed-Solomon decoder can correct up to t symbols that contain errors in a codeword, where 2t = n-k.


Decoder RS(31,19)

Decoder RS(255,223)



Our RS(31,19) consist five primary subsystem, they are Input block, Power Sums Tower, Sugiyama Tower, Correction Tower, and Error Values Module.


Almost the same design, just bigger.

Current Status : 

Mantainers and Authors

REED SOLOMON development team 

Current members : Ibrahim Budiarjo, Yudha Pratomo, Erik P Kamal, Christanto Sahat, Sarwono Sutikno