Citation
Abstract
The binary weight distributions of the (7,5) and (15,9) Reed-Solomon (RS) codes and their duals are computed using the Mac Williams identities. Several mappings of symbols to bits are considered and those offering the largest binary minimum distance are found. These results are then used to compute bounds on the softdecoding performance of these codes in the presence of additive Gaussian noise. These bounds are useful for finding large binary block codes with good performance and for verifying the performance obtained by specific soft-decoding algorithms presently under development.
Details
- Volume
- 42-110
- Published
- August 15, 1992
- Pages
- 208–215
- File Size
- 317.5 KB