Recursive error correction for general Reed-Muller codes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Designs, Codes and Cryptography
Low-Overhead Implementation of a Soft Decision Helper Data Algorithm for SRAM PUFs
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Soft decision helper data algorithm for SRAM PUFs
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Recursive error correction for general Reed-Muller codes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Proceedings of the 3rd international workshop on Trustworthy embedded devices
| Hi-index | 754.84 |
Constructs Reed-Muller codes by generalized multiple concatenation of binary block codes of length 2. As a consequence of this construction, a new decoding procedure is derived that uses soft-decision information. The algorithm is designed for low decoding complexity and is applicable to all Reed-Muller codes. It gives better decoding performance than soft-decision bounded-distance decoding. Its decoding complexity is much lower than that of maximum-likelihood trellis decoding of Reed-Muller codes, especially for long codes