Create Reed-Solomon code from binary vector data
Communications Toolbox / Error Detection and Correction / Block
The Binary-Input RS Encoder block creates a Reed-Solomon code.
The symbols for the code are binary sequences of length M, corresponding to elements of the Galois field GF(2M). The first bit in each symbol is the most significant bit.
Suppose M = 3, N = 23-1 = 7, and K = 2. Then a message is a vector of length 2 whose entries are integers between 0 and 7. A corresponding codeword is a vector of length 7 whose entries are integers between 0 and 7. The following figure illustrates possible input and output signals to this block when codeword length N=7 and message word length K=2. Since N=2M–1, when N=7, the symbol length, M=3.
Each input message word is a binary vector of length 6, that represents 2 three-bit integers. Each corresponding output codeword is a binary vector of length 21 that represents 7 three-bit integers. For more information, see Input and Output Signal Length in RS Blocks.
This object implements the algorithm, inputs, and outputs described in Algorithms for BCH and RS Errors-only Decoding.