Abstract
An efficient encoder circuit for a systematic Reed-Solomon code with arbitrary parity positions is presented. In contrast to the Reed-Solomon encoder circuits widely available today, the parity symbols produced by this encoder are not restricted to form a block of consecutive parity symbols at the beginning or end of the codeword, but may be spread arbitrarily within the codeword. A general structure of the parity-check matrix for such a code is derived by exploiting the special structure of Vandermonde matrices. From this general parity-check matrix, an expression for the calculation of the Reed-Solomon parity symbols at arbitrary positions within the codeword is found and an efficient hardware implementation of the proposed encoder is designed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
