Abstract
A method for decoding RS (Reed Solomon) codes which used fixed decoding time and does not depend upon the number of errors present in messages is presented. The method is much simpler compared to existing decoding algorithms for RS codes. However, for large values of p (where p>or=0.2), the performance degrades significantly because for large noise levels the improvement obtained by error correction codes is less significant and is not necessarily worth the calculations and improved error correction techniques. This technique has not only resulted in improvement in signal to noise ratio and error correction capabilities but also saves the bandwidth. This savings was achieved by shortening the block length of RS code by omitting information symbols that do not reduce its minimum distance, and therefore any shortened RS code is also a maximum distance separable code. The use of neural network approaches improved the speed of computation, the simplicity, and robustness in addition to improvement in error correction and signal to noise ratio. >
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.
