Reed Solomon Coding _16 PSK Using Simulink
Format of Reed-Solomon Codes
The basic building block of Reed-Solomon codes is a symbol composed of m binary bits, where m can be any natural number greater than 2. For a given m, the length of all the Reed-Solomon codes composed of m-bit symbols is 2m - 1. For example, for 8-bit symbols, the length of the Reed-Solomon codes is 28 - 1 = 255.
A complete Reed-Solomon code consists of two parts: the data part and the parity part. For a Reed-Solomon code of n symbols, the first k symbols is the data part, which is the information to be protected against corruption, and the following (n-k) symbols is the parity part, which is calculated based on the data part. Such a Reed-Solomon code is referred to as an (n, k) Reed-Solomon code, or RS(n,k) code. The number of parity symbols is (n-k), usually an even number represented as 2t. A Reed-Solomon code with 2t parity symbols has the capability of correcting up to t error symbols.
Cite As
Khan Sadaf (2024). Reed Solomon Coding _16 PSK Using Simulink (https://www.mathworks.com/matlabcentral/fileexchange/32127-reed-solomon-coding-_16-psk-using-simulink), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |