Abstract

This paper discusses the algebraic structure of cascaded Reed-Solomon (CRS) codes, and presents an algorithm for decoding them. A CRS code is a cascade (or generalized concatenated ) code constructed using Reed-Solomon codes as component codes. In particular, we consider hyperbolic CRS (HCRS) codes: these are CRS codes designed to have the minimum distance given by the cascade code bound. Compared to Reed-Solomon codes over the same alphabet, HCRS codes have longer block-lengths. Compared to other two dimensional cyclic codes (products of Reed-Solomon codes, duals of such products, and codes proposed by Sakata [1]) with the same minimum distance, HCRS codes have higher rates.

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 call

Disclaimer: 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.