Abstract: Encoding and decoding of Reed-Muller codes have been a major research topic in coding and theoretical computer science communities. Despite of the fact that there have been numerous encoding ...
Abstract: In this letter, we propose a low-complexity universal decoder for product codes based on guessing codeword decoding (GCD). Recognizing that errors typically concentrate at the intersections ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback