Description: The package contains a Reed-Solomon coding and decoding program, derived
partly from Phil Karn/Robert Morelos-Zaragoza \"new_rs_erasures.c\".
In particular the Berlekamp-Massey algorithm has not been modified. New
features compared to \"new_rs_erasures.c\" are:
- fully parameterized: code parameters (n,k,m) can be selected via
command line options.
- decoding optional by Euclid or Belekamp-Massey algorithm
- efficient support of shortened codes
- extensive verbose levels for hardware verification
Platform: |
Size: 18432 |
Author:shijianhong |
Hits:
Description: The package contains a Reed-Solomon coding and decoding program, derived
partly from Phil Karn/Robert Morelos-Zaragoza "new_rs_erasures.c".
In particular the Berlekamp-Massey algorithm has not been modified. New
features compared to "new_rs_erasures.c" are:
- fully parameterized: code parameters (n,k,m) can be selected via
command line options.
- decoding optional by Euclid or Belekamp-Massey algorithm
- efficient support of shortened codes
- extensive verbose levels for hardware verification
Platform: |
Size: 17408 |
Author:shijianhong |
Hits:
Description: 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. Platform: |
Size: 2048 |
Author:jjjura |
Hits:
Search - shortened reed solomon code