Fast Decoding Algorithms for First Order Reed-Muller and Related Codes
Designs, Codes and Cryptography
| Hi-index | 754.84 |
An approach for efficient utilization of fast Hadamard transform in decoding binary linear block codes is presented. Computational gain is obtained by employing various types of concurring codewords, and memory reduction is also achieved by appropriately selecting rows for the generator matrix. The availability of these codewords in general, and particularly in some of the most frequently encountered codes, is discussed.