Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 355-364 |
Number of pages | 10 |
Journal | IEEE Transactions on Information Theory |
Volume | 32 |
Issue number | 3 |
DOIs | |
State | Published - May 1986 |