Citation
Abstract
A new set of e-error-correcting Maximum Distance Separable codes of lengths (2°41) over GF(2™) are generated as binary codes of length m(2™+1) shortened from certain cyclic codes of length (22™—1) with 2me parity bits. Encoding uses a binary division shift register of size 2me and an auxiliary computation involving 2me binary additions. Decoding can be done by standard Reed-Solomon decoding techniques. In fact, the new codes can be considered extended Reed-Solomon codes.
Details
- Volume
- 42-103
- Published
- November 15, 1990
- Pages
- 151–153
- File Size
- 143.7 KB