Search - reed solomon code in matlab

Search - reed solomon code in matlab - List

[Program doc] fountaincode DL : 0: 数字喷泉码的编码matlab代码及编译码说明，编码代码附录在文后-code encoding and the encryption code Matlab note, coding code in the text after the Appendix
Date : 2025-07-09 Size : 574kb User : 王锋
[GPS develop] RS DL : 1: ReedSolomon编码译码的matlab源程序-ReedSolomon encoding decoding source code matlab
Date : 2025-07-09 Size : 3kb User : lau
[Communication-Mobile] Errors_And_Erasures_Test DL : 1: This matlab code on reed solomon and BCH encoding and different decoding algorithms. Also errors and erasures.
Date : 2025-07-09 Size : 27kb User : kishore
[matlab] upload_pudn6 DL : 0: This program is used to Simulate the performance of (n,k)Reed Solomon code in AWGN channel with plotting the results and compare with the theoretical performance of this code in AWGN channel. The program also print the SNRdB, absolute snr ,simulated probability of error, exact probability of error in each steps-This program is used to Simulate the performance of (n,k)Reed Solomon code in AWGN channel with plotting the results and compare with the theoretical performance of this code in AWGN channel. The program also print the SNRdB, absolute snr ,simulated probability of error, exact probability of error in each steps
Date : 2025-07-09 Size : 1kb User : ghanim
[Algorithm] RSdecoder_BMalgoritmus DL : 1: DECODED = RSDEC(CODE,N,K) attempts to decode the received signal in CODE using an (N,K) Reed-Solomon decoder with the narrow-sense generator polynomial. CODE is a Galois array of symbols over GF(2^m), where m is the number of bits per symbol. Each N-element row of CODE represents a corrupted systematic codeword, where the parity symbols are at the end and the leftmost symbol is the most significant symbol. If N is smaller than 2^m-1, then RSDEC assumes that CODE is a corrupted version of a shortened code.-DECODED = RSDEC(CODE,N,K) attempts to decode the received signal in CODE using an (N,K) Reed-Solomon decoder with the narrow-sense generator polynomial. CODE is a Galois array of symbols over GF(2^m), where m is the number of bits per symbol. Each N-element row of CODE represents a corrupted systematic codeword, where the parity symbols are at the end and the leftmost symbol is the most significant symbol. If N is smaller than 2^m-1, then RSDEC assumes that CODE is a corrupted version of a shortened code.
Date : 2025-07-09 Size : 2kb User : jjjura
[Picture Viewer] prepeocessox_refer DL : 1: 在matlab中,使用Koetter-Vardy算法进行Reed-Solomon码的解码-In matlab, use the Koetter- Vardy Reed- Solomon code decoding algorithm
Date : 2025-07-09 Size : 5kb User : Frjnklin
[OS program] Rmld DL : 1: 在matlab中,使用Koetter-Vardy算法进行Reed-Solomon码的解码(In matlab, use the Koetter - Vardy Reed - Solomon code decoding algorithm)
Date : 2025-07-09 Size : 4kb User : dzm%2D274